leetcode

300. Longest Increasing Subsequence

Solution code: O(n log(n))

Time complexity: O(n log(n))

Space complexity: O(n)

Solution code: O(n^2)

Time complexity: O(n^2)

Space complexity: O(n)