2016年6月3日
300. 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 inc 阅读全文
posted @ 2016-06-03 14:09 新一代的天皇巨星 阅读(428) 评论(0) 推荐(0)
334. Increasing Triplet Subsequence
摘要： Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if 阅读全文
posted @ 2016-06-03 13:51 新一代的天皇巨星 阅读(218) 评论(0) 推荐(0)