【LeetCode】 300. Longest Increasing Subsequence 最长上升子序列（Medium）（JAVA）

【LeetCode】 300. Longest Increasing Subsequence 最长上升子序列（Medium）（JAVA）

题目地址: https://leetcode.com/problems/longest-increasing-subsequence/

题目描述：

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].

Example 1:

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

Example 2:

Input: nums = [0,1,0,3,2,3]
Output: 4

Example 3:

Input: nums = [7,7,7,7,7,7,7]
Output: 1

Constraints:

• 1 <= nums.length <= 2500
• -10^4 <= nums[i] <= 10^4

Follow up:

• Could you come up with the O(n^2) solution?
• Could you improve it to O(n log(n)) time complexity?

题目大意

给定一个无序的整数数组，找到其中最长上升子序列的长度。

说明:

• 可能会有多种最长上升子序列的组合，你只需要输出对应的长度即可。
• 你算法的时间复杂度应该为 O(n^2) 。

进阶: 你能将算法的时间复杂度降低到 O(n log n) 吗?

解题方法

1. 维护一个有序队列 list
2. 用新的元素替换有序队列中相应的位置，如果比最后一个元素大，就加入有序队列中（这样做是为了使上升序列尽可能得慢）
3. note: 时间复杂度 O(nlogn) , 替换的时候用的二分查找 O(logn) 时间复杂度

class Solution {
    public int lengthOfLIS(int[] nums) {
        List<Integer> list = new ArrayList<>();
        for (int i = 0; i < nums.length; i++) {
            addNum(list, nums[i]);
        }
        return list.size();
    }
    
    public void addNum(List<Integer> list, int num) {
        if (list.size() == 0 || list.get(list.size() - 1) < num) {
            list.add(num);
            return;
        }
        int start = 0;
        int end = list.size() - 1;
        while (start <= end) {
            int mid = start + (end - start) / 2;
            if (list.get(mid) == num) return;
            if (list.get(mid) > num) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
        list.set(start, num);
    }
}

执行耗时:6 ms,击败了78.78% 的Java用户
内存消耗:38.1 MB,击败了11.40% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新