leetcode 300. Longest Increasing Subsequence

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

For example,
Given [10, 9, 2, 5, 3, 7, 101, 18],
The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that 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?

很经典的一道题
暴力方法复杂度是平方。
这里要使复杂度为$O(nlogn)$需要采用二分搜索。

生成一个数组dp，dp的过程生成的过程是这样的，
首先dp全零，设置一个变量len，表示到目前为止的最长序列数
然后一个个遍历数组nums，访问到num时，在dp的0-len之中查找num，准确的说是插入num的位置。如果插入位置为len，说明num为最目前最大数，直接将len处置为num，如果在0-len之中，说明在访问num之前已经出现过了最长序列，num处并不是最长序列的结尾，只需要替换即可。值得注意的是，在查找num之前dp[len]=0。
这样可以保证dp是一个递增的数组，在0-len上。

public class Solution {
    public int lengthOfLIS(int[] nums) {
        if(nums==null||nums.length==0) return 0;
        int[] dp = new int[nums.length];
        int len = 0;

        for(int num: nums){
            int i = Arrays.binarySearch(dp, 0, len, num);
            if(i<0) i = -(i+1);
            dp[i] = num;
            if(i==len) len++;
        }
        return len;
    }
}

如果不用Jave体统的API，写法如下

  dietpepsi 
Reputation:  4,264
tails is an array storing the smallest tail of all increasing subsequences with length i+1 in tails[i].
For example, say we have nums = [4,5,6,3], then all the available increasing subsequences are:

len = 1   :      [4], [5], [6], [3]   => tails[0] = 3
len = 2   :      [4, 5], [5, 6]       => tails[1] = 5
len = 3   :      [4, 5, 6]            => tails[2] = 6
We can easily prove that tails is a increasing array. Therefore it is possible to do a binary search in tails array to find the one needs update.

Each time we only do one of the two:

(1) if x is larger than all tails, append it, increase the size by 1
(2) if tails[i-1] < x <= tails[i], update tails[i]
Doing so will maintain the tails invariant. The the final answer is just the size.

Java

public int lengthOfLIS(int[] nums) {
    int[] tails = new int[nums.length];
    int size = 0;
    for (int x : nums) {
        int i = 0, j = size;
        while (i != j) {
            int m = (i + j) / 2;
            if (tails[m] < x)
                i = m + 1;
            else
                j = m;
        }
        tails[i] = x;
        if (i == size) ++size;
    }
    return size;
}