[leetcode] 300. Longest Increasing Subsequence

题目：leetcode 300题链接
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?

题意：
找出最长的升序子串

思路：
创建一个数组save[]跟原数组大小相同，用来保存包括nums[i]能构成的最长的子串。
save[0]=1;
这样i从第二个开始遍历nums[i],嵌套循环j从头开始比较如果nums[j]

public class Solution {
    public int lengthOfLIS(int[] nums) {
        int result = 0;
        int len = nums.length;
        if(len == 0){
            return 0;
        }
        int[] save = new int[len];
        save[0] = 1;
        for(int i = 1; i < len; i++){
            int num = nums[i];
            int temp1 = 1;
            int temp2 = 1;
            for(int j =0 ;j < i ;j++){
                if(nums[j] < num){
                    temp1 = save[j] +1;
                    if(temp1 >temp2){
                        temp2 = temp1;
                    }
                }
            }
            save[i] = temp2;
        }
        for(int i = 0; i < len; i++){
            if(result < save[i]){
                result = save[i];
            }
        }
        return result;
    }
}