LeetCode--300. 最长上升子序列（java）

推荐题解

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