Longest Increasing Subsequence LeetCode solution in C++

1
class Solution {
2
 public:
3
  int lengthOfLIS(vector<int> &nums) {
4
    int n = nums.size();
5
    vector<int> dp(n, 1);
6
    for (int i = n - 2; i >= 0; i--) {
7
      for (int j = i + 1; j < n; j++) {
8
        if (nums[j] > nums[i]) dp[i] = max(dp[i], 1 + dp[j]);
9
      }
10
    }
11
    int mx = 0;
12
    for (int i = 0; i < n; i++) mx = max(mx, dp[i]);
13
    return mx;
14
  }
15
};