#673 Number of Longest Increasing Subsequence

最新推荐文章于 2024-09-11 15:54:46 发布

yoyooyooo

最新推荐文章于 2024-09-11 15:54:46 发布

阅读量58

点赞数

分类专栏： leetcode 文章标签： leetcode 动态规划算法

本文链接：https://blog.csdn.net/YY_Tina/article/details/123199003

版权

leetcode 专栏收录该内容

188 篇文章 0 订阅

订阅专栏

Description

Given an integer array nums, return the number of longest increasing subsequences.

Notice that the sequence has to be strictly increasing.

Examples

Example 1:

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

Example 2:

Input: nums = [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.

Constraints:
1 <= nums.length <= 2000
$10^6$ <= nums[i] <= $10^6$

思路

就是dp啦，可以参考300的方法1，多加入一个统计length的数组就可以了，不过感觉还能改进，因为现在的复杂度还是 $O(n^2)$

代码

class Solution {
    public int findNumberOfLIS(int[] nums) {
        int[] maxLength = new int[nums.length];
        int[] lengthCount = new int[nums.length];
        
        for(int i = 0; i < nums.length; i++){
            maxLength[i] = 1;
            lengthCount[i] = 0;
            for(int j = 0; j < i; j++){
                if (nums[i] > nums[j]){
                    maxLength[i] = Math.max(maxLength[i], maxLength[j] + 1);
                }
            }    
            for(int j = 0; j < i; j++){
                if (nums[i] > nums[j] && maxLength[i] == maxLength[j] + 1){
                   lengthCount[i] += lengthCount[j];
                }
            }
            lengthCount[i] = Math.max(1, lengthCount[i]);
        }
        
        int maxLen = 0;
        int lenCnt = 0;
        for (int i = 0; i < nums.length; i++){
            maxLen = Math.max(maxLen, maxLength[i]);
        }
        for (int i = 0; i < nums.length; i++){
            if (maxLength[i] == maxLen)
                lenCnt += lengthCount[i];
        }
        
        return lenCnt;
    }
}