Leetcode Problem 300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

Leetcode Solutions

Initialize an empty array sub.
Iterate over each number in nums. a. If sub is empty or the current number is greater than the last element in sub, append the number to sub. b. Otherwise, use binary search to find the first element in sub that is not smaller than the current number and replace that element with the current number.
The length of the array sub is the length of the longest increasing subsequence.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen