1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-11-09 15:59:06 +01:00

cpp: add “300. Longest Increasing Subsequence”

Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2024-01-05 23:42:43 +01:00
parent 489d931f11
commit 4340c17b03
Signed by: mfocko
GPG key ID: 7C47D46246790496

View file

@ -0,0 +1,25 @@
#include <algorithm>
#include <vector>
class Solution {
public:
int lengthOfLIS(const std::vector<int> &nums) {
if (nums.empty()) {
return 0;
}
std::vector<int> dp(nums.size(), 1);
int m = 1;
for (auto i = 1u; i < nums.size(); ++i) {
for (auto j = 0u; j < i; ++j) {
if (nums[i] > nums[j]) {
dp[i] = std::max(dp[i], 1 + dp[j]);
m = std::max(m, dp[i]);
}
}
}
return m;
}
};