03 2020 档案

[LeetCode] 337. House Robber III
摘要：The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
posted @ 2020-03-22 03:15 Review->Improve 阅读(153) 评论(0) 推荐(0)
[LeetCode] 198. House Robber
摘要：You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
posted @ 2020-03-22 03:13 Review->Improve 阅读(113) 评论(0) 推荐(0)
[LeetCode] 213. House Robber II
摘要：You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are ar 阅读全文
posted @ 2020-03-22 03:12 Review->Improve 阅读(135) 评论(0) 推荐(0)
[LeetCode] 1183. Maximum Number of Ones
摘要：Consider a matrix M with dimensions width * height, such that every cell has value 0 or 1, and any square sub-matrix of M of size sideLength * sideLen 阅读全文
posted @ 2020-03-19 05:26 Review->Improve 阅读(4311) 评论(0) 推荐(0)
[LeetCode] 301. Remove Invalid Parentheses
摘要：Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may cont 阅读全文
posted @ 2020-03-19 02:12 Review->Improve 阅读(229) 评论(0) 推荐(0)
[LeetCode] 940. Distinct Subsequences II
摘要：Given a string S, count the number of distinct, non-empty subsequences of S . Since the result may be large, return the answer modulo 10^9 + 7. Exampl 阅读全文
posted @ 2020-03-18 03:09 Review->Improve 阅读(192) 评论(0) 推荐(0)
[CodeForces] 1325D Ehab the Xorcist
摘要：Given 2 integers u and v, find the shortest array such that bitwise-xor of its elements is u, and the sum of its elements is v. Input The only line co 阅读全文
posted @ 2020-03-17 07:11 Review->Improve 阅读(297) 评论(0) 推荐(0)
[LeetCode 1371] Find the Longest Substring Containing Vowels in Even Counts
摘要：Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must 阅读全文
posted @ 2020-03-08 05:19 Review->Improve 阅读(760) 评论(0) 推荐(0)
Number Theory Problems and Study Notes
摘要：Primitive Primes : two integers are coprime if their GCD is 1. If a number A is not divisible by another prime number P, then A and P are guranteed to 阅读全文
posted @ 2020-03-05 23:19 Review->Improve 阅读(148) 评论(0) 推荐(0)
[LeetCode 1368] Minimum Cost to Make at Least One Valid Path in a Grid
摘要：Given a m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit if you are currently in this cell. The sign of grid[i] 阅读全文
posted @ 2020-03-02 08:23 Review->Improve 阅读(1029) 评论(0) 推荐(0)
[CodeForces] Perform the Combo
摘要：An interesting problem using suffix sum. For each wrong tries that is correct until after index p[i], we add 1 to cnt[p[i]]. This represents that all 阅读全文
posted @ 2020-03-01 06:31 Review->Improve 阅读(130) 评论(0) 推荐(0)