[leetCode刷题笔记]300. Longest Increasing Subsequence

DP解决，用dp[len]表示遍历到的最大值，新的值如果大于这个值len++否则替换dp中的一个len不变

public class Solution {
public int lengthOfLIS(int[] nums) {
//use dp[len] to store the largest val.
int[] dp = new int[nums.length];
int len = 0;
for (int k : nums) {
int i = Arrays.binarySearch(dp, 0, len, k);
if (i < 0) i = -(i + 1);
dp[i] = k;
if (i == len) len++;
}
return len;
}
}