Package g0601_0700.s0673_number_of_longest_increasing_subsequence

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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 the longest increasing subsequence is 1, and there are 5 increasing subsequences of length 1, so output 5.

    Constraints:

    • 1 <= nums.length <= 2000

    • <code>-10<sup>6</sup><= numsi<= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer findNumberOfLIS(IntArray nums)

      • Methods inherited from class java.lang.Object

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