LeetCode300. Longest Increasing Subsequence

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

}