[LintCode] Longest Increasing Subsequence 最长递增子序列

Given a sequence of integers, find the longest increasing subsequence (LIS).You code should return the length of the LIS.Have you met this question in...
posted @ 2015-10-19 12:04  Grandyang  阅读(5786)  评论(0)    收藏  举报
Fork me on GitHub