[C++] lower_bound

https://leetcode.com/problems/longest-increasing-subsequence/

LeetCode - The World's Leading Online Programming Learning Platform

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        vector<int> tmp;
        for (int num : nums) {
            auto it = lower_bound(tmp.begin(), tmp.end(), num);
            if (it == tmp.end()) {
                tmp.push_back(num);
            } else {
                *it = num;
            }
        }
        return tmp.size();
    }
};