-
标签:dynamic programming
- 分享数 224
-
0
-
dynamic-programming-python-leetcode(动态规划)
- 2018-03-26
- Python开发
- 阅读数459
-
0
-
LeetCode 72. Edit Distance(编辑距离)
- 2018-03-26
- 其它
- 阅读数483
-
0
-
LeetCode 64. Minimum Path Sum(最小路径和)
- 2018-03-24
- 其它
- 阅读数260
-
0
-
LeetCode 63. Unique Paths II(唯一出路Ⅱ)
- 2018-03-24
- UI/UE
- 阅读数141
-
0
-
《Reinforcement Learning》 读书笔记 4:动态规划
- 2018-03-22
- 其它
- 阅读数176
-
0
-
LeetCode 53. Maximum Subarray(最大子数组和)
- 2018-03-22
- 其它
- 阅读数267
-
0
-
LeetCode 44. Wildcard Matching(通配符匹配)
- 2018-03-20
- 其它
- 阅读数197
-
0
-
LeetCode 32. Longest Valid Parentheses(最长合法圆括号子序列)
- 2018-03-19
- 其它
- 阅读数471
-
0
-
LeetCode 10. Regular Expression Matching(正则表达式匹配)
- 2018-03-16
- 其它
- 阅读数369
-
0
-
子集和问题(动态规划解法)
- 2018-02-20
- 其它
- 阅读数162
-
0
-
动态规划--多阶段决策之单向TSP问题
- 2018-01-23
- 其它
- 阅读数323
-
0
-
动态规划--DAG(有向无环图)问题
- 2018-01-21
- 其它
- 阅读数127
-
0
-
动态规划--数字三角形问题
- 2018-01-18
- 其它
- 阅读数190
-
0
-
646. Maximum Length of Pair Chain
- 2018-01-14
- 人工智能
- 阅读数302
-
0
-
639. Decode Ways II
- 2018-01-14
- 其它
- 阅读数351
-
0
-
413. Arithmetic Slices
- 2018-01-05
- 其它
- 阅读数155
-
0
-
714. Best Time to Buy and Sell Stock with Transaction Fee
- 2017-12-28
- Web前端
- 阅读数513
-
0
-
309. Best Time to Buy and Sell Stock with Cooldown
- 2017-12-28
- 其它
- 阅读数302
-
0
-
338. Counting Bits
- 2017-12-27
- 其它
- 阅读数78
-
0
-
300. Longest Increasing Subsequence
- 2017-12-26
- UI/UE
- 阅读数120
-
0
-
97. Interleaving String
- 2017-12-20
- 其它
- 阅读数197
-
0
-
32. Longest Valid Parentheses
- 2017-12-16
- 其它
- 阅读数155
-
0
-
516. Longest Palindromic Subsequence
- 2017-12-16
- UI/UE
- 阅读数78
-
0
-
647. Palindromic Substrings
- 2017-12-16
- 其它
- 阅读数239
-
0
-
5. Longest Palindromic Substring
- 2017-12-16
- 其它
- 阅读数169