#leetcode
doing , don't stop
| List(Medium) | Done | Review | Date | info |
|---|---|---|---|---|
| 419. Battleships in a Board | 2017.02.05 | clear what mean | ||
| 338. Counting Bits | 2017.02.05 | i&1 / i&(i-1) / how many 1 ... | ||
| 413. Arithmetic Slices | 2017.02.06 | change thought not Continuity than jump/reserve | ||
| 406. Queue Reconstruction by Height | 2017.02.07 | need think others && find regular && sort+imb && vector+insert && beat97% | ||
| 495. Teemo Attacking | 2017.02.10 | not through out ! && way is right | ||
| 508. Most Frequent Subtree Sum | 2017.02.17 | dfs && recus && not clear through | ||
| 515. Find Largest Value in Each Tree Row | 2017.02.18 | dfs && recus && vector && dfs(deep++)__dfs(deep+1) | ||
| 513. Find Bottom Left Tree Value | 2017.02.19 | dfs && recus && vector && like 515 504 | ||
| 442. Find All Duplicates in an Array | 2017.02.25 | tradition: unordered_map or ^... tip : 1 ≤ a[i] ≤ n && think difference ! | ||
| 462. Minimum Moves to Equal Array Elements II.cpp | 2017.02.27 | purl math ,need to thing more ... | ||
| 526. Beautiful Arrangement | 2017.03.08 | dfs (**another look) && need to clear more | ||
| 2. Add Two Numbers | 2017.05.22 | understand problem && c++ point list(new) && /10 %10 if?: | ||
| 3. Longest Substring Without Repeating Characters | 2017.05.25 | I really fuck don't know anything , onle to copy one answer to comfort me . | ||
| 198. 打家劫舍 | 2021.10.04 | 贪心算法和动态规划(考虑全局子问题，通常是俩个)的区别 | ||
| 213. 打家劫舍 II | 2021.10.04 | 不同范围的动态规划 | ||
| 740. 删除并获得点数 | 2021.10.04 | 去除前一后一个和间隔是一样的意思。dp[i] 这里的i是什么意思 |
| List(EASY) | Done | Review | Date | info |
|---|---|---|---|---|
| 1. Two Sum | 2016.12 | |||
| 2. Add Two Numbers | 2016.12 | |||
| 6. ZigZag Conversion | 2016.12 | |||
| 7. Reverse Integer | 2016.12 | |||
| 9. Palindrome Number | 2016.12.28 2017.01.13 | |||
| 461. Hamming Distance | 2016.12.29 | |||
| 412. Fizz Buzz | 2016.12.30 | |||
| 448. Find All Numbers Disappeared in an Array.cpp | 2016.12.31 | |||
| dfs | 2017.01.04 | |||
| 463. Island Perimeter | 2017.01.05 | need to imp with dfs | ||
| 136. Single Number | 2017.01.06 | |||
| binary tree | 2017.01.07 | delet not understand | ||
| 104. Maximum Depth of Binary Tree.cpp | 2017.01.07 | xor | ||
| 389. Find the Difference.cpp | 2017.01.08 | xor | ||
| 455. Assign Cookies | 2017.01.08 | simple greed or nothing | ||
| 453. Minimum Moves to Equal Array Elements | 2017.01.09 | size-1 increment === only one decrement&&.. | ||
| 383. Ransom Note.cpp | 2017.01.10 | map or vector to check if dup | ||
| 404. Sum of Left Leaves | 2017.01.17 | tree && Recursion | ||
| 100. Same Tree | 2017.01.20 | tree && Recursion && oncepass so high ! | ||
| 387. First Unique Character in a String | 2017.01.20 | map or vector to check if dup | ||
| 492. Construct the Rectangle | 2017.01.22 | sqrt and find first %=0 | ||
| 476. Number Complement | 2017.02.04 | binary first byte && (& ^ ~) | ||
| 485. Max Consecutive Ones | 2017.02.04 | travel once | ||
| 167. Two Sum II - Input array is sorted | 2017.02.05 | undered_map or two point |