1. class Solution:
    2.     def findNumberOfLIS(self, nums: List[int]) -> int:
    3.         #nums = [2,2,2,2,2]
    4.         n = len(nums)
    5.         if n == 0:
    6.             return 0
    8.         dp = [1] * n
    9.         ans = [1] * n
    10.         for i in range(n):
    11.             for j in range(i):
    12.                 if nums[j] < nums[i]:
    13.                     if dp[j] + 1 > dp[i]:
    14.                         dp[i] = dp[j] + 1
    15.                         ans[i] = ans[j]
    16.                     elif dp[j] + 1 == dp[i]:
    17.                         ans[i] += ans[j]
    18.         length = max(dp)
    19.         result = 0
    20.         for i in range(n):
    21.             if dp[i] == length:
    22.                 result += ans[i]
    24.         return result673. Number of Longest Increasing Subsequence