Review->Improve - 博客园

2019年3月4日

[LeetCode] 1000. Minimum Cost to Merge Stones

摘要： There are N piles of stones arranged in a row. The i-th pile has stones[i] stones. A move consists of merging exactly K consecutive piles into one pil 阅读全文

posted @ 2019-03-04 07:49 Review->Improve 阅读(856) 评论(0) 推荐(0) 编辑

[LeetCode] 1004. Max Consecutive Ones III

摘要： Given an array A of 0s and 1s, we may change up to K values from 0 to 1. Return the length of the longest (contiguous) subarray that contains only 1s. 阅读全文

posted @ 2019-03-04 00:33 Review->Improve 阅读(743) 评论(0) 推荐(0) 编辑

[LeetCode] 1003. Check If Word Is Valid After Substitutions

摘要： We are given that the string "abc" is valid. From any valid string V, we may split V into two pieces X and Y such that X + Y (X concatenated with Y) i 阅读全文

posted @ 2019-03-04 00:14 Review->Improve 阅读(705) 评论(0) 推荐(0) 编辑

2019年3月2日

[LeetCode] 82. Remove Duplicates from Sorted List II

摘要： Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Example 1: Example 2: 阅读全文

posted @ 2019-03-02 13:20 Review->Improve 阅读(115) 评论(0) 推荐(0) 编辑

[LeetCode] 907. Sum of Subarray Minimums

摘要： Given an array of integers A, find the sum of min(B), where B ranges over every (contiguous) subarray of A. Since the answer may be large, return the 阅读全文

posted @ 2019-03-02 00:51 Review->Improve 阅读(1199) 评论(0) 推荐(0) 编辑

2019年2月26日

[LeetCode] 1001. Grid Illumination

摘要： On a N x N grid of cells, each cell (x, y) with 0 <= x < N and 0 <= y < N has a lamp. Initially, some number of lamps are on. lamps[i] tells us the lo 阅读全文

posted @ 2019-02-26 12:38 Review->Improve 阅读(594) 评论(0) 推荐(0) 编辑

2019年2月19日

[LeetCode] 995. Minimum Number of K Consecutive Bit Flips

摘要： In an array A containing only 0s and 1s, a K-bit flip consists of choosing a (contiguous) subarray of length K and simultaneously changing every 0 in 阅读全文

posted @ 2019-02-19 07:13 Review->Improve 阅读(1480) 评论(0) 推荐(0) 编辑

2019年2月13日

[LeetCode] 872. Leaf-Similar Trees

摘要： Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given t 阅读全文

posted @ 2019-02-13 22:57 Review->Improve 阅读(168) 评论(0) 推荐(0) 编辑

2019年2月12日

[Daily Coding Problem 72] Max path value in directed graph

摘要： This problem was asked by Google. In a directed graph, each node is assigned an uppercase letter. We define a path's value as the number of most frequ 阅读全文

posted @ 2019-02-12 13:00 Review->Improve 阅读(3865) 评论(0) 推荐(0) 编辑

2019年2月11日

[LeetCode 989] Add to Array-Form of Integer

摘要： For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array form is [ 阅读全文

posted @ 2019-02-11 07:07 Review->Improve 阅读(827) 评论(0) 推荐(0) 编辑

Push your limit!

Tell me and I will forget. Show me and I will remember. Involve me and I will understand!

公告