2015年11月3日
[LeetCode] Longest Increasing Subsequence
摘要： A typical O(n^2) solution uses dynamic programming. Let's use lens[j] to denote the length of the LIS ending with nums[j]. The state equations arelens... 阅读全文
posted @ 2015-11-03 22:15 jianchao-li 阅读(401) 评论(1) 推荐(0) 编辑