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 <code>nums</code>, return the length of the longest strictly increasing subsequence.

&nbsp;
Example 1:

<pre>
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
</pre>

Example 2:

<pre>
Input: nums = [0,1,0,3,2,3]
Output: 4
</pre>

Example 3:

<pre>
Input: nums = [7,7,7,7,7,7,7]
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2500</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
</ul>

&nbsp;
Follow up:&nbsp;Can you come up with an algorithm that runs in&nbsp;<code>O(n log(n))</code> time complexity?

lengthOfLIS

Longest Increasing Subsequence

Increasing Triplet Subsequence

increasing-triplet-subsequence

递增的三元子序列

Russian Doll Envelopes

russian-doll-envelopes

俄罗斯套娃信封问题

Maximum Length of Pair Chain

maximum-length-of-pair-chain

最长数对链

Number of Longest Increasing Subsequence

number-of-longest-increasing-subsequence

最长递增子序列的个数

Minimum ASCII Delete Sum for Two Strings

minimum-ascii-delete-sum-for-two-strings

两个字符串的最小ASCII删除和

Minimum Number of Removals to Make Mountain Array

minimum-number-of-removals-to-make-mountain-array

得到山形数组的最少删除次数

Find the Longest Valid Obstacle Course at Each Position

find-the-longest-valid-obstacle-course-at-each-position

找出到每个位置为止最长的有效障碍赛跑路线

Minimum Operations to Make the Array K-Increasing

minimum-operations-to-make-the-array-k-increasing

使数组 K 递增的最少操作次数

Longest Ideal Subsequence

longest-ideal-subsequence

最长理想子序列

Maximum Number of Books You Can Take

maximum-number-of-books-you-can-take

你能拿走的最大图书数量

Longest Increasing Subsequence II

longest-increasing-subsequence-ii

最长递增子序列 II

Find the Maximum Length of a Good Subsequence II

find-the-maximum-length-of-a-good-subsequence-ii

求出最长好子序列 II

Find the Maximum Length of a Good Subsequence I

find-the-maximum-length-of-a-good-subsequence-i

求出最长好子序列 I

Find the Maximum Length of Valid Subsequence I

find-the-maximum-length-of-valid-subsequence-i

找出有效子序列的最大长度 I

Find the Maximum Length of Valid Subsequence II

find-the-maximum-length-of-valid-subsequence-ii

找出有效子序列的最大长度 II

Longest Subsequence With Decreasing Adjacent Difference

longest-subsequence-with-decreasing-adjacent-difference

最长相邻绝对差递减子序列

Array

Binary Search

Dynamic Programming

给你一个整数数组 <code>nums</code> ，找到其中最长严格递增子序列的长度。

子序列&nbsp;是由数组派生而来的序列，删除（或不删除）数组中的元素而不改变其余元素的顺序。例如，<code>[3,6,2,7]</code> 是数组 <code>[0,3,1,6,2,2,7]</code> 的子序列。
&nbsp;

示例 1：

<pre>
输入：nums = [10,9,2,5,3,7,101,18]
输出：4
解释：最长递增子序列是 [2,3,7,101]，因此长度为 4 。
</pre>

示例 2：

<pre>
输入：nums = [0,1,0,3,2,3]
输出：4
</pre>

示例 3：

<pre>
输入：nums = [7,7,7,7,7,7,7]
输出：1
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2500</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
</ul>

&nbsp;

进阶：

<ul>
	<li>你能将算法的时间复杂度降低到&nbsp;<code>O(n log(n))</code> 吗?</li>
</ul>