LongestIncreasingSubsequence.java 源码
package algorithm.dp;
import java.util.Arrays;
/**
* @author roseduan
* 最长上升子序列
*/
public class LongestIncreasingSubsequence {
/**
* 动态规划
*/
public int lengthOfLIS1(int[] nums) {
return 1;
}
}