Longest Increasing Subsequence.java

import java.util.Arrays;

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