摘要: http://www.lintcode.com/en/problem/longest-increasing-continuous-subsequence-ii/# Give you an integer matrix (with row size n, column size m),find the longest increasing continuous subsequence i... 阅读全文
posted @ 2015-05-26 16:03 Acjx 阅读(1928) 评论(0) 推荐(0) 编辑
摘要: http://www.lintcode.com/en/problem/longest-increasing-continuous-subsequence/# Give you an integer array (index from 0 to n-1, where n is the size of this array),find the longest increasing cont... 阅读全文
posted @ 2015-05-26 11:49 Acjx 阅读(697) 评论(0) 推荐(0) 编辑