leetcode

Algorithm II: Day 16

2 files changed, 23 insertions(+), 0 deletions(-)

diff --git a/ Problems/0673.cpp b/ Problems/0673.cpp

@@ -0,0 +1,22 @@

class Solution {

public:

int findNumberOfLIS(vector<int> &nums) {

int n = nums.size(), res = 0, max_len = 0;

vector<pair<int, int>> dp(n, {1, 1});

for (int i = 0; i < n; i++) {

for (int j = 0; j < i; j++) {

if (nums[i] > nums[j]) {

if (dp[i].first == dp[j].first + 1) dp[i].second += dp[j].second;

if (dp[i].first < dp[j].first + 1)

dp[i] = {dp[j].first + 1, dp[j].second};

}

}

if (max_len == dp[i].first) res += dp[i].second;

if (max_len < dp[i].first) {

max_len = dp[i].first;

res = dp[i].second;

}

}

return res;

}

};

diff --git a/ README.md b/ README.md

@@ -269,6 +269,7 @@ for solving problems. | 0662 | Medium | [Maximum Width of Binary Tree](Problems/0662.cpp) | | 0669 | Medium | [Trim a Binary Search Tree](Problems/0669.cpp) | | 0671 | Easy | [Second Minimum Node In a Binary Tree](Problems/0671.cpp) |

| 0673 | Medium | [Number of Longest Increasing Subsequence](Problems/0673.cpp) |

| 0684 | Medium | [Redundant Connection](Problems/0684.cpp) | | 0692 | Medium | [Top K Frequent Words](Problems/0692.cpp) | | 0695 | Medium | [Max Area of Island](Problems/0695.cpp) |