Package g0201_0300.s0300_longest_increasing_subsequence

Class Solution

java.lang.Object

g0201_0300.s0300_longest_increasing_subsequence.Solution

public class Solution
extends Object

300 - Longest Increasing Subsequence.<p>Medium</p> <p>Given an integer array <code>nums</code>, return the length of the longest strictly increasing subsequence.</p> <p>A <strong>subsequence</strong> is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example, <code>[3,6,2,7]</code> is a subsequence of the array <code>[0,3,1,6,2,2,7]</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [10,9,2,5,3,7,101,18]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> The longest increasing subsequence is [2,3,7,101], therefore the length is 4.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [0,1,0,3,2,3]</p> <p><strong>Output:</strong> 4</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [7,7,7,7,7,7,7]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 2500</code></li> <li><code>-10⁴ <= nums[i] <= 10⁴</code></li> </ul> <p><strong>Follow up:</strong> Can you come up with an algorithm that runs in <code>O(n log(n))</code> time complexity?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	lengthOfLIS(int[] nums)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

lengthOfLIS

public int lengthOfLIS(int[] nums)