-
标签:dynamic programming
- 分享数 224
-
0
-
#116 Jump Game
- 2016-08-25
- 其它
- 阅读数77
-
0
-
#118 Distinct Subsequences
- 2016-08-25
- UI/UE
- 阅读数92
-
0
-
#119 Edit Distance
- 2016-08-25
- 其它
- 阅读数162
-
0
-
#125 Backpack II
- 2016-08-25
- 其它
- 阅读数141
-
0
-
#151 Best Time to Buy and Sell Stock III
- 2016-08-23
- 其它
- 阅读数113
-
0
-
#149 Best Time to Buy and Sell Stock
- 2016-08-23
- 其它
- 阅读数92
-
0
-
Leetcode - Dynamic Programming - 343. Integer Break(划分整数得到最大乘积)
- 2016-08-22
- 其它
- 阅读数501
-
0
-
#20 Dices Sum
- 2016-08-22
- 其它
- 阅读数33
-
0
-
#191 Maximum Product Subarray
- 2016-08-21
- 其它
- 阅读数134
-
0
-
#392 House Robber
- 2016-08-19
- 其它
- 阅读数190
-
0
-
#395 Coins in a Line II
- 2016-08-19
- 其它
- 阅读数260
-
0
-
#394 Coins in a Line
- 2016-08-19
- 其它
- 阅读数483
-
0
-
#366 Fibonacci
- 2016-08-19
- 其它
- 阅读数66
-
0
-
#397 Longest Increasing Continuous Subsequence
- 2016-08-18
- UI/UE
- 阅读数295
-
0
-
【leetcode】String——Distinct Subsequences(115)
- 2016-08-14
- UI/UE
- 阅读数218
-
0
-
#476 Stone Game
- 2016-08-14
- 其它
- 阅读数13
-
0
-
LintCode动态规划题总结
- 2016-08-13
- 其它
- 阅读数141
-
0
-
※ Leetcode - Dynamic Programming - 53.Maximum Subarray(最大连续和)+152.Maximum Product Subarray(最大连续积)
- 2016-08-08
- 其它
- 阅读数260
-
0
-
#109 Triangle
- 2016-08-08
- 其它
- 阅读数85
-
0
-
#163 Unique Binary Search Trees
- 2016-08-08
- UI/UE
- 阅读数127
-
0
-
#115 Unique Paths II
- 2016-08-08
- UI/UE
- 阅读数375
-
0
-
#114 Unique Paths
- 2016-08-07
- UI/UE
- 阅读数357
-
0
-
#107 Word Break
- 2016-08-05
- 其它
- 阅读数239
-
0
-
[leetcode] 44. Wildcard Matching
- 2016-08-01
- 其它
- 阅读数579
-
0
-
leetcode-121. Best Time to Buy and Sell Stock
- 2016-07-30
- 其它
- 阅读数93