摘要:
这篇文章的主题是动态规划, 主要介绍LeetCode中一维动态规划的题目, 列表如下:Climbing StairsDecode WaysUnique Binary Search TreesMaximum SubarrayMaximum Product SubarrayBest Time to Bu... 阅读全文
posted @ 2015-01-30 02:27
WinsCoder
阅读(1181)
评论(0)
推荐(2)
摘要:
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw... 阅读全文
posted @ 2015-01-30 02:23
WinsCoder
阅读(178)
评论(0)
推荐(0)

浙公网安备 33010602011771号