leetcode 300. Longest Increasing Subsequence 最长上升序列数

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?

这道题是求数组当中的最长的上升子序列。

可用使用动态规划，用数组res[i]表示到i 时的最长上升序列数，取在i前面比num[i]小的数的最长在上升序列来更新res[i]，所以时间复杂度为 O(n2)。

    public int lengthOfLIS(int[] nums) {
        int[]  res=new int[nums.length];
        int max=0;
        for(int i=0;i<nums.length;i++){
            res[i]=1;
            for(int j=0;j<i;j++){
                if(nums[i]>nums[j])
                    res[i]=Math.max(res[i],res[j]+1);
            }
            max=Math.max(max,res[i]);
        }
        return max;
    }