LeetCode-300. Longest Increasing Subsequence [C++][Java]

LeetCode-300. Longest Increasing Subsequencehttps://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: Can you come up with an algorithm that runs in O(n log(n)) time complexity?

解题思路

【C++】

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        int max_length = 0, n = nums.size();
        if (n <= 1) {return n;}
        vector<int> dp(n, 1);
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < i; ++j) {
                if (nums[i] > nums[j]) {
                    dp[i] = max(dp[i], dp[j] + 1);
                }
            }
            max_length = max(max_length, dp[i]);
        }
        return max_length;
    }
};

二分查找将时间复杂度将i时间复杂度降低为O(nlogn)。

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        int n = nums.size();
        if (n <= 1) {return n;}
        vector<int> dp;
        dp.push_back(nums[0]);
        for (int i = 1; i < n; ++i) {
            if (dp.back() < nums[i]) {
                dp.push_back(nums[i]);
            } else {
                auto it = lower_bound(dp.begin(), dp.end(), nums[i]);
                *it = nums[i];
            }
        }
        return dp.size();
    }
};

【Java】

class Solution {
    public int lengthOfLIS(int[] nums) {
        int max_length = 0, n = nums.length;
        if (n <= 1) {return n;}
        int[] dp = new int[n];
        Arrays.fill(dp, 1);
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < i; ++j) {
                if (nums[i] > nums[j]) {
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }
            max_length = Math.max(max_length, dp[i]);
        }
        return max_length;
    }
}

参考文献

【1】C++ STL lower_bound，upper_bound的使用总结_weixin_30587927的博客-CSDN博客

【2】关于C++ STL中的lower_bound用法_苏格拉没有底-CSDN博客_std::lower_bound