Longest Increasing Subsequence
Input
nums: the integer sequence
Output
the length of longest subsequence
Examples
Example 1:
Input:
1nums = [50, 3, 10, 7, 40, 80]
Output: 4
Explanation:
The longest subsequence is [3, 7, 40, 80] which has length 4.
Example 2:
Input:
1nums = [1, 2, 4, 3]
Output: 3
Explanation:
Both [1, 2, 4] and [1, 2, 3] are longest subsequences which have length 3.
Try it yourself
Solution
Title
Script
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.
Contrary to popular belief, Lorem Ipsum is not simply random text.
1 >>> a = [1, 2, 3] 2 >>> a[-1] 3 3