Leetcode
LC 264 | JZ 49 LC 264 | JZ 49
Solution to LeetCode 264 Ugly Number II. LeetCode 264 | JZ 49Ugly Number II (Medium). [LeetCode link] Dynamic Programmi
LC 3 | JZ 48 LC 3 | JZ 48
Solution to LeetCode 3 Longest Substring Without Repeating Characters. LeetCode 3 | JZ 48Longest Substring Without Repea
JZ 46 & JZ 47 JZ 46 & JZ 47
Solution to JZ 46 Translate numbers to letters & JZ 47 Max price of gift. JZ 46Translate numbers to letters (Medium)
LC 53 | JZ 42 & LC 918 LC 53 | JZ 42 & LC 918
Solution to LeetCode 53 Maximum Subarray & LeetCode 918 Maximum Sum Circular Subarray. 题目思想: “走完这一生, 如果我和你在一起会变得更好,
LC 198 & LC 213 & LC 337 LC 198 & LC 213 & LC 337
Solution to LeetCode 198 House Robber & LeetCode 213 House Robber II & LeetCode 337 House Robber III. LeetCode
LC 509, LC 1137 & JZ10 LC 509, LC 1137 & JZ10
Solution to LeetCode 509 Fibonacci Number, LeetCode 1137 N-th Tribonacci Number, and JZ 10 Fibonacci number. LeetCode 50
LC 140 LC 140
Solution to LeetCode 140 Word Break II. LeetCode 140Word Break II (Hard). [link] Different from LC 139, this problem ask
LC 139 LC 139
Solution to LeetCode 139 Word Break I. LeetCode 139Word Break I (Medium). [link] 1] Dynamic Programming. tmp[i] = True m
3 / 3