中级农民
- 积分
- 216
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2015-7-3
- 最后登录
- 1970-1-1
|
本帖最后由 frandblinkc 于 2018-10-12 14:41 编辑
发一下目前的进度:
## 09/22/2018 Sat
* 69. Sqrt(x): failed due to integer overflow; revised and accepted
* 374. Guess number higher or lower: ac
* 33. Search in a rotated array: ac
* 278. First Bad Version: ac
* 162. First Peak Element: ac
* 153. Find minimum in Rotated Sorted Array: ac
* Search for a Range: ac
* 658. Find K cloest Elements: ac but not with best solution; modified after seeing discussion
## 09/25/2018 Tue
* 4. Median of Two Sorted Arrays: ac but took more than 1 hour, corner cases!
* 702. Search in a Sorted Array of Unknown Size: ac
* 50. Pow(x, n): integer overflow for - (-2^31); modified and ac
## 09/26/2018 Wed
* 367.Valid Perfect Square: ac
* 744.Find Smallest Letter Greater Than Target: ac
* 154.Find Minimum in Rotated Sorted Array II: ac with linear scan; found one binary search solution...
* 349.Intersection of Two Arrays: ac
* 350.Intersection of Two Arrays II: ac
* 167.Two Sum II - Input array is sorted: ac
* 287.Find the Duplicate Number: didn't solve, checked solutions and re-wrote
* 719.Find K-th Smallest Pair Distance: didn't solve, checked solution and wait for re-writing
## 09/27/2018 Thu
* 719.Find K-th Smallest Pair Distance: wrote own notes and ac
* (TODO) 410. Split Array Largest Sum: no clue, saw the binary search answer but greedy valid function is hard to prove to be always working
## 09/28/2018 Friday
* Iterative traverse of binary trees: searched online and found easy to remember/understand solutions: [Iterative traversals for Binary Trees](quiver-note-url/E3FD6091-71C9-4021-B5FC-B13C40E9C5AB)
* 144.Binary Tree Preorder Traversal
* 145.Binary Tree Postorder Traversal
* 102.Binary Tree Level Order
* 104.Maximum Depth of Binary Tree
* 101.Symmetric Tree
## 09/29/2018 Saturday
* 112.Path Sum
* 250.Count Univalue Subtrees
* 106.Construct Binary Tree from Inorder and Postorder Traversal
* 105.Construct Binary Tree from Preorder and Inorder Traversal
* 116.Populating Next Right Pointers in Each Node
* 117.Populating Next Right Pointers in Each Node II
* 236.Lowest Common Ancestor of a Binary Tree
* 297.Serialize and Deserialize Binary Tree
* 98.Validate Binary Search Tree
## 09/30/2018 Sunday
* 285.Inorder Successor in BST
* 173.Binary Search Tree Iterator
* 700.Search in a Binary Search Tree
* 701.Insert into a Binary Search Tree
* 450. Delete Node in a BST
* 703.Kth Largest Element in a Stream
* 235.Lowest Common Ancestor of a Binary Search Tree
## 10/01/2018 Monday
* 220.Contains Duplicate III
* 110.Balanced Binary Tree
* 108.Convert Sorted Array to Binary Search Tree
## 10/02/2018 Tuesday
* 63.Unique Paths II
* 64.Minimum Path Sum
## 10/03/2018 Wednesday
* 5. Longest Palindromic Substring
* 53.Maximum Subarray
* 121.Best Time to Buy and Sell Stock
## 10/04/2018 Thursday
* 70.Climbing Stairs
* 10.Regular Expression Matching
* 198.House Robber
* 338.Counting Bits
## 10/05/2018 Friday
Study 背包九讲
## 10/06/2018 Saturday
* 152. Maximum Product Subarray
* 72. Edit Distance
* 96. Unique Binary Search Trees
* 279. Perfect Squares
* 312. Burst Balloons
## 10/07/2018 Sunday
* 120. Triangle
* 62. Unique Paths
* 64. Minimum Path Sum
* 123. Best Time to Buy and Sell Stock III
* 303. Range Sum Query - Immutable
## 10/08/2018 Monday
Tag: DP, 4 Hard 2 Medium
* 32. Longest Valid Parentheses
* 115. Distinct Subsequences
* 140. Word Break II
* 188. Best Time to Buy and Sell Stock IV
* 647. Palindromic Substrings
* 91. Decode Ways
## 10/09/2018 Tuesday
Tag: DP, 1 Hard 1 Easy 5 Medium
* 95. Unique Binary Search Trees II (DP, clone and offset subtree)
* 309.Best Time to Buy and Sell Stock with Cooldown (hold/unhold dp)
* 413.Arithmetic Slices (single sequence dp)
* 322.Coin Change (complete backpack, use amount + 1 as +Inf)
* 746.Min Cost Climbing Stairs (coorindate dp)
* 264. Ugly Number II (heap; merge sorted arrays!!!)
* 97.Interleaving String (2D DP < BFS < DFS + memoization)
## 10/10/2018 Wednesday
Tag: DP; 2 Hard 3 Medium
* 357.Count Numbers with Unique Digits
* 300.Longest Increasing Subsequence (DP+binary search: construct LIS minimal tails array)
* 343.Integer Break (factor 2 and 3; pow is O(1) for double)
* 87. Scramble String (divide&conquer + pruning; dp)
* 44.Wildcard Matching (dp; greedy)
今天几道题都很蛋疼啊,300 O(nlogn)方法, 343 Math, 都是想不到就想不到,87转移方程写错了一步debug了好久。。。
## 10/11/2018 Thursday
Tag: DP 1.5 Hard 4 Medium
* 221. Maximal Square (2D dp)
* 375. Guess Number Higher or Lower II
* 174. Dungeon Game (2D dp, reverse thinking!!!)
* 304.Range Sum Query 2D - Immutable
* 516.Longest Palindromic Subsequence
* 354.Russian Doll Envelopes (扫描线做出来了。。发现题意理解错了,等宽不能套)
|
|