LeetCode week 9 : Number of Longest Increasing Subsequence

题目

地址：
https://leetcode.com/problems/number-of-longest-increasing-subsequence/description/
类别： Dynamic Programming
难度： Medium
描述：
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.

分析

题目要求从一个未排序的数组中得到最长递增子序列长度maxLength，因为最长递增子序列可能不止一个，所以要求输出所有长度为maxLength的序列个数。

解决

在上一个题目第一个方法中我们只需要用len[i]来存储以nums[i]结尾的最长递增子序列长度，而此题为了得到以nums[i]结尾的最长递增子序列个数，我们添加一个量cnt[i]，并有相应状态迁移方程。

For a sequence of numbers,
cnt[i]: the total number of longest subsequence ending with nums[i];
len[i]: the length of longest subsequence ending with nums[i];

状态迁移方程:

len[i] = max(len[i], len[j]+1) for all j < i and nums[j] < nums[i];
cnt[i] = sum(cnt[j]) for all j < i and len[j] = len[i]-1;

时间复杂度：（O（n²））
代码实现

class Solution {
public:
    int findNumberOfLIS(vector<int>& nums) {
        int size = nums.size();
        vector<int> cnt(size, 1), len(size, 1);
        int maxLen = 1, count = 0;
        for(int i = 0; i < size; i++) {
            for(int j = i-1; j >= 0; j--) {
                if(nums[i] > nums[j]) {
                    if(len[j] + 1 > len[i]) {
                        len[i] = len[j] + 1;
                        cnt[i] = cnt[j];
                    } else if(len[j] + 1 == len[i])   
                        cnt[i] = cnt[i] + cnt[j];
                }
            }
            maxLen = max(maxLen, len[i]);
        }
        for(int i = 0; i < size; i++) {
            if(len[i] == maxLen) count = count + cnt[i];
        }
        return count;
    }
};

参考:
https://discuss.leetcode.com/topic/102974/c-dp-with-explanation-o-n-2