LeetCode 300 Longest Increasing Subsequence (二分+单调栈)

最新推荐文章于 2021-03-04 16:03:50 发布

_TCgogogo_

最新推荐文章于 2021-03-04 16:03:50 发布

阅读量390

点赞数

分类专栏： Leetcode Medium LeetCode 文章标签：二分单调栈 LIS

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/88418679

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 0 订阅

订阅专栏

Given an unsorted array of integers, find the length of longest increasing subsequence.

Example:

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

Note:

There may be more than one LIS combination, it is only necessary for you to return the length.
Your algorithm should run in O(n2) complexity.

Follow up: Could you improve it to O(n log n) time complexity?

题目链接：https://leetcode.com/problems/longest-increasing-subsequence/

题目分析：LIS，二分+单调栈

0ms，时间击败100%

class Solution {
    
    public int lowerBound(int[] a, int n, int target) {
        int l = 1, r = n, mid = 0, ans = 0;
        while (l <= r) {
            mid = (l + r) >> 1;
            if (a[mid] >= target) {
                ans = mid;
                r = mid - 1;
            } else {
                l = mid + 1;
            }
        }
        return ans;
    }
    
    public int lengthOfLIS(int[] nums) {
        int[] stk = new int[nums.length + 1];
        int top = 0;
        for (int i = 0; i < nums.length; i++) {
            if (top == 0 || stk[top] < nums[i]) {
                stk[++top] = nums[i];
            } else {
                stk[lowerBound(stk, top, nums[i])] = nums[i];
            }
        }
        return top;
    }
}