算法第八周Number of Longest Increasing Subsequence[medium]

最新推荐文章于 2022-12-02 12:07:24 发布

south_l

最新推荐文章于 2022-12-02 12:07:24 发布

阅读量236

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/south_l/article/details/78346653

版权

算法专栏收录该内容

41 篇文章 0 订阅

订阅专栏

Number of Longest Increasing Subsequence[medium

Description

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.

Solution

这道题目也是LIS问题，只不过它的返回值是最长子序列的个数，而之前的问题是返回最长子序列的长度。
我采用的是动态规划，复杂度为O(n*n)的解法；
增加了一个数组c[l]，用来记录对于每一值对于他自己作为末尾元素的最长子序列的个数。
对于某个nums[i]而言，如果f[i] < f[j] + 1, j < i，那么他作为末尾元素的最长子序列的长度就要变成f[j] + 1，并且他的c[i] 要等于 c[j];如果f[i] == f[j] + 1, j < i，那么这种情况下与他作为末尾元素的最长子序列的长度相同，并且他的c[i] 要等于 c[i]+c[j];

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