2017年9月27日
[LeetCode] 673. Number of Longest Increasing Subsequence 最长递增序列的个数
摘要： Given an unsorted array of integers, find the number of longest increasing subsequence. Example 1: Input: [1,3,5,4,7] Output: 2 Explanation: The two l 阅读全文
posted @ 2017-09-27 21:06 Grandyang 阅读(10428) 评论(3) 推荐(1) 编辑
Fork me on GitHub