Skip to content

Latest commit

 

History

History
17 lines (11 loc) · 386 Bytes

File metadata and controls

17 lines (11 loc) · 386 Bytes

227.Longest Increasing Subsequence

Description

Given an unsorted array of integers, find the length of longest increasing subsequence.

Example

Input: [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.

From

LeetCode