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:
- There may be more than one LIS combination, it is only necessary for you to return the length.
- Your algorithm should run in O(n2) complexity.
Follow up: Could you improve it to O(n log n) time complexity?
思路:构建最长增长子序列数组res,如果nums[i]比res中某个数略小,则替换该数,这个并不影响res 的长度,但能减小res的增长速率,有利于后续的判断。
int lengthOfLIS(vector<int>& nums) {
vector<int> res;
for(int i=0; i<nums.size(); i++) {
// 找到第一个比nums[i]大或相等的数的位置
auto it = std::lower_bound(res.begin(), res.end(), nums[i]);
//检查是插入还是添加到尾端
if(it==res.end()) res.push_back(nums[i]);
else *it = nums[i];
}
return res.size();
}