Algorithm-week13

Week13

Problem--Medium--673. Number of Longest Increasing Subsequence

Given an unsorted array of integers, find the number of longest increasing subsequence.

Example 1:

Input: [1,3,5,4,7]
Output: 2
Explanation: The two longest increasing subsequence are [1, 3, 4, 7] and [1, 3, 5, 7].

Example 2:

Input: [2,2,2,2,2]
Output: 5
Explanation: The length of longest continuous increasing subsequence is 1, and there are 5 subsequences' length is 1, so output 5.

Note: Length of the given array will be not exceed 2000 and the answer is guaranteed to be fit in 32-bit signed int.

题目解析：

这一道题基于寻找最长递增子序列，但这次找的不是最长为多少，二是最长子序列有多少个。类似的，我们可以通过动态规划的方法寻找最长子序列的长度，然后在寻找的过程中新增一个状态变量存储有多少条长度最长的子序列。那么什么时候个数需要增加呢？当我们更新最长长度len的时候，发现当前i的len已经被更新为最长值，说明之前有另外一条路径到达了i并且形成当前最长子串，因此当前是一条新路径，因而在这时候计数增一。

首先，我们定义状态：

len[i]代表以第i个数结尾的子串的最长的子序列的长度；

count[i]代表以第i个数结尾的子串最长子序列的个数；

状态转移：

if nums[i] > nums[j] && len[i] < len[j] + 1: len[i] = len[j] + 1 (i > j)

if nums[i] > nums[j] && len[j] + 1 == len[i]: count[i] += count[j]; else: count[i] = count[j]

代码：

class Solution {
public:
    int findNumberOfLIS(vector<int>& nums) {
        if (!nums.size()) {
            return 0;
        }
        int n = nums.size();
        int max_length = 1;
        vector<int> count(n, 1), len(n, 1);
        for (int i = 1; i < nums.size(); i++) {
            for (int j = 0; j < i; j++) {
                if (nums[i] > nums[j]) {
                    if (len[j] + 1 > len[i]) {
                        len[i] = len[j] + 1;
                        count[i] = count[j];
                    } else if (len[j] + 1 == len[i]) {
                        cout << len[j] << " " << len[i] << endl;
                        count[i] += count[j];
                    }
                }
            }
            max_length = max(len[i], max_length);
        }
        int result = 0;
        for (int i = 0; i < n; i++) {
            cout << count[i] << endl;
            if (len[i] == max_length) {
                result += count[i];
            }
        }
        return result;
    }
};

---