2016年1月14日
Longest Increasing Subsequence
摘要： Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], therefore t... 阅读全文
posted @ 2016-01-14 11:01 dylqt 阅读(182) 评论(0) 推荐(0) 编辑