动态规划-查找最长递增子数列的数目

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.

思路：1、先动态规划求出长度数组；

           2、再从长度数组中动态规划求出最长递增子序列的数目；

          3、从动态规划结果中得到最长递增子序列的数目；

class Solution {
public:
    int findNumberOfLIS(vector<int>& nums) {
        vector<int> lenDp(nums.size(), 1);
        vector<int> numDp(nums.size(), 1);
        int curMaxLen = 1;
        int times = 0;
        for(int i=0; i<nums.size(); i++)
        {
            int tempMaxLen = 1;
            for(int j=i-1; j>=0; j--)
            {
                if(nums[i] > nums[j])
                {
                    tempMaxLen = max(lenDp[j]+1, tempMaxLen);
                }
                               
            }
            lenDp[i] = tempMaxLen;
            curMaxLen = max(curMaxLen, lenDp[i]);
            
        }

        for(int i=0; i<lenDp.size(); i++)
        {
            cout << lenDp[i] <<',';
            int maxCnt = 0;
            for(int j=i-1; j>=0; j--)
            {
                if(lenDp[j] == lenDp[i]-1 && nums[i] > nums[j])
                {
                    maxCnt += numDp[j];
                }
            }

           numDp[i] = max(1, maxCnt);
        }
        
        cout << endl;
        for(int i=0; i<lenDp.size(); i++)
        {
            
            cout << numDp[i] <<',';
            if(lenDp[i] == curMaxLen)
            {
                times += numDp[i];
            }
        }
        
        return times;
    }
};