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

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

Array

Binary Search

Dynamic Programming

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie