number-of-longest-increasing-subsequence

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array&nbsp;<code>nums</code>, return the number of longest increasing subsequences.

Notice that the sequence has to be strictly increasing.

&nbsp;
Example 1:

<pre>
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].
</pre>

Example 2:

<pre>
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.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2000</code></li>
	<li><code>-106 &lt;= nums[i] &lt;= 106</code></li>
	<li>The answer is guaranteed to fit inside a 32-bit integer.</li>
</ul>

findNumberOfLIS

Number of Longest Increasing Subsequence

Longest Increasing Subsequence

longest-increasing-subsequence

最长递增子序列

Longest Continuous Increasing Subsequence

longest-continuous-increasing-subsequence

最长连续递增序列

Longest Increasing Subsequence II

longest-increasing-subsequence-ii

最长递增子序列 II

Binary Indexed Tree

Segment Tree

Array

Dynamic Programming

给定一个未排序的整数数组<meta charset="UTF-8" />&nbsp;<code>nums</code>&nbsp;，&nbsp;返回最长递增子序列的个数&nbsp;。

注意&nbsp;这个数列必须是 严格 递增的。

&nbsp;

示例 1:

<pre>
输入: [1,3,5,4,7]
输出: 2
解释: 有两个最长递增子序列，分别是 [1, 3, 4, 7] 和[1, 3, 5, 7]。
</pre>

示例 2:

<pre>
输入: [2,2,2,2,2]
输出: 5
解释: 最长递增子序列的长度是1，并且存在5个子序列的长度为1，因此输出5。
</pre>

&nbsp;

提示:&nbsp;

<meta charset="UTF-8" />

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2000</code></li>
	<li><code>-106&nbsp;&lt;= nums[i] &lt;= 106</code></li>
</ul>