seyjs - 博客园

2019年5月29日

摘要：题目如下： Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 阅读全文

posted @ 2019-05-29 15:14 seyjs 阅读(132) 评论(0) 推荐(0)

【leetcode】233. Number of Digit One

摘要：题目如下： Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. Example: 解题思路：本题是《编程之美》上的题阅读全文

posted @ 2019-05-29 14:34 seyjs 阅读(333) 评论(0) 推荐(0)

2019年5月28日

【leetcode】877. Stone Game

摘要：题目如下： Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number 阅读全文

posted @ 2019-05-28 17:26 seyjs 阅读(303) 评论(0) 推荐(0)

2019年5月27日

【leetcode】1054. Distant Barcodes

摘要：题目如下： In a warehouse, there is a row of barcodes, where the i-th barcode is barcodes[i]. Rearrange the barcodes so that no two adjacent barcodes are e 阅读全文

posted @ 2019-05-27 14:35 seyjs 阅读(486) 评论(0) 推荐(0)

【leetcode】1051. Height Checker

摘要：题目如下： Students are asked to stand in non-decreasing order of heights for an annual photo. Return the minimum number of students not standing in the ri 阅读全文

posted @ 2019-05-27 14:31 seyjs 阅读(665) 评论(0) 推荐(0)

【leetcode】1053. Previous Permutation With One Swap

摘要：题目如下： Given an array A of positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller than A, that 阅读全文

posted @ 2019-05-27 10:07 seyjs 阅读(449) 评论(0) 推荐(0)

【leetcode】1052. Grumpy Bookstore Owner

摘要：题目如下： Today, the bookstore owner has a store open for customers.length minutes. Every minute, some number of customers (customers[i]) enter the store, 阅读全文

posted @ 2019-05-27 10:02 seyjs 阅读(736) 评论(0) 推荐(0)

2019年5月24日

【leetcode】1034. Coloring A Border

摘要：题目如下： Given a 2-dimensional grid of integers, each value in the grid represents the color of the grid square at that location. Two squares belong to t 阅读全文

posted @ 2019-05-24 15:11 seyjs 阅读(416) 评论(0) 推荐(0)

2019年5月22日

【leetcode】1042. Flower Planting With No Adjacent

摘要：题目如下： You have N gardens, labelled 1 to N. In each garden, you want to plant one of 4 types of flowers. paths[i] = [x, y] describes the existence of a 阅读全文

posted @ 2019-05-22 11:07 seyjs 阅读(678) 评论(0) 推荐(0)

2019年5月21日

【leetcode】1035. Uncrossed Lines

摘要：题目如下： We write the integers of A and B (in the order they are given) on two separate horizontal lines. Now, we may draw connecting lines: a straight l 阅读全文

posted @ 2019-05-21 17:49 seyjs 阅读(1341) 评论(0) 推荐(0)

公告