太nb了这题
Given an integer array nums, return the length of the longest strictly increasing subsequence.
A subsequence 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, [3,6,2,7] is a subsequence of the array [0,3,1,6,2,2,7].
出这题的人是真的骚
首先有一个常规的dp解法,这个我都想不出来
其次还可以用贪心+二分做成nlogn