g0201_0300.s0300_longest_increasing_subsequence.Solution.cpp Maven / Gradle / Ivy

Go to download
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
// #2024_05_22_Time_4_ms_(94.11%)_Space_12.9_MB_(61.94%)

#include 
#include 
using namespace std;

class Solution {
public:
    int lengthOfLIS(vector& nums) {
        if (nums.empty()) {
            return 0;
        }
        vector dp(nums.size() + 1, INT_MAX);
        int left = 1;
        int right = 1;

        for (int curr : nums) {
            int start = left;
            int end = right;
            // binary search, find the one that is lower than curr
            while (start + 1 < end) {
                int mid = start + (end - start) / 2;
                if (dp[mid] > curr) {
                    end = mid;
                } else {
                    start = mid;
                }
            }
            // update our dp table
            if (dp[start] > curr) {
                dp[start] = curr;
            } else if (curr > dp[start] && curr < dp[end]) {
                dp[end] = curr;
            } else if (curr > dp[end]) {
                dp[++end] = curr;
                right++;
            }
        }
        return right;
    }
};