300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

public class Main{
    public int lengthOfLIS(int[] nums){//动态规划做法
        int length = nums.length;
        int[] dp = new int[length];
        dp[0] = 1;
        int res = 1;
        for(int i=1;i<length;i++){
	        dp[i] = 1;//这里不可少！dp要全部初始化
            for(int j=0;j<i;j++){ //遍历之前保存的dp状态找出最大值
                if(nums[i]>nums[j]){
                    dp[i] = (dp[j]+1>dp[i])? dp[j]+1:dp[i];
                }//else{
                 //   dp[i] = (dp[j]>dp[i])? dp[j]:dp[i];
                //}                
            }
            res = Arrays.stream(dp).max().getAsInt();            
        }
        for(int i=0;i<length;i++){
            System.out.println(dp[i]);
        }
        return res; //注意不是dp[length-1]！！！
    }
    
    public static void main(String[] args) {
        Main mm = new Main();
        /*返回数组最大值*/
        //int[] nums = {10,9,2,5,3,7,101,18};
        int[] nums = {4,10,4,3,8,9};
        int res = mm.lengthOfLIS(nums);
        System.out.println("result is " + res);
        
        int res2 = mm.answer(nums);
        System.out.println("result2 is " + res2);
        
        //法一 sort
        Arrays.sort(nums);
        int mmax = nums[nums.length-1];
        //System.out.println(mmax);
        //法三 stream
        int mmax2 = Arrays.stream(nums).max().getAsInt();
        //System.out.println(mmax2);
        
        //法二 Collections.max(Integer[] array)
        Integer[] numbers = {4,10,4,3,8,9};
        int mmax1 = (int)Collections.max(Arrays.asList(numbers));//nums必须是int的包装类Integer，不能直接用基本数据类型int
        //System.out.println(mmax1);
        
    }
}