Longest Increasing Subsequence

1public int lengthOfLIS(int[] nums) {
2    if (nums == null || nums.length == 0) return 0;
3
4    int[] dp = new int[nums.length];
5    Arrays.fill(dp, 1);
6    
7    int maxLength = 1;
8
9    for (int i = 0; i < nums.length; i++) {
10        for (int j = 0; j < i; j++) {
11            if (nums[i] > nums[j]) {
12                dp[i] = Math.max(dp[i], dp[j] + 1);
13            }
14        }
15        maxLength = Math.max(maxLength, dp[i]);
16    }
17    return maxLength;
18}