leetcode 300 最长上升子序列

 思想真的很nb,二分法是锦上添花。。很难想到吧，建议这题看题解中浏览量最高的那个

class Solution {
public:
void insert(int num, vector<int>&nums) {
	int left = 0;
	int right = nums.size() - 1;
	int mid = 0;
	while (left < right) {
		mid = (left + right) / 2;
        if (nums[mid] == num)
			return;
		if (num > nums[mid])
			left = mid + 1;
		else 
			right = mid;
	}
	nums[left] = num;  //注意这句话，替换掉比它大的数中最小的数
}

int lengthOfLIS(vector<int>& nums) {
    if (nums.size() == 0)
		return 0;
	vector<int>result;
	result.push_back(nums[0]);
	for (int i = 1; i < nums.size(); i++) {
		if (nums[i] > *result.rbegin())
			result.push_back(nums[i]);
		else
			insert(nums[i], result);
	}
	return result.size();
}
};