leetcode Longest Increasing Subsequence

题目链接

动态规划。算法复杂度n平方

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

        int max=0;
        for(int i=0;i<nums.length;i++)
        {
            max=Math.max(max, record[i]);
        }
        return max+1;
    }
}