DP-Longest Increasing Subsequence解析中有个小错误

[amylmy]

解法１的状态转移方程应该是：

f[j] = max{f[i], 0 <= i < j && nums[i] < nums[j]} + 1

原来的写成了：

f[j] = max{f[i], 0 <= i < j && f[i] < f[j]} + 1