Package g0601_0700.s0673_number_of_longest_increasing_subsequence

Class Solution

java.lang.Object

g0601_0700.s0673_number_of_longest_increasing_subsequence.Solution

public class Solution
extends Object

673 - Number of Longest Increasing Subsequence\. Medium Given an integer array `nums`, return _the number of longest increasing subsequences._ **Notice** that the sequence has to be **strictly** increasing. **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` * -106 <= nums[i] <= 106

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	findNumberOfLIS(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findNumberOfLIS

public int findNumberOfLIS(int[] nums)