forked from LeetCode-in-Cpp/LeetCode-in-Cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.cpp
44 lines (41 loc) · 1.31 KB
/
Solution.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// #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 <vector>
#include <limits.h>
using namespace std;
class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if (nums.empty()) {
return 0;
}
vector<int> 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;
}
};