标签：input bin nbsp you algo sort for return script
Given an unsorted array of integers, find the length of longest increasing subsequence.
Example:
Input:[10,9,2,5,3,7,101,18]Output: 4 Explanation: The longest increasing subsequence is[2,3,7,101], therefore the length is4.
Note:
Follow up: Could you improve it to O(n log n) time complexity?
思路
代码
[leetcode]300. Longest Increasing Subsequence最长递增子序列
标签：input bin nbsp you algo sort for return script
原文地址：https://www.cnblogs.com/liuliu5151/p/9841060.html
