/*
f[i] 第i个元素结尾的递增子序列长度
*/
class Solution {
public int lengthOfLIS(int[] nums) {
int n = nums.length;
int[] f = new int[n + 1];
for (int i = 1; i <= n; i ++) {
f[i] = 1;
for (int j = 1; j < i; j ++) {
if (nums[i - 1] > nums[j - 1]) f[i] = Math.max(f[i], f[j] + 1);
}
}
int res = 0;
for (int i : f) {
if (i > res) res = i;
}
return res;
}
}