300. Longest Increasing Subsequence

Given an unsorted array of integers, find the length of longest increasing subsequence.

For example,
Given [10, 9, 2, 5, 3, 7, 101, 18],
The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that there may be more than one LIS combination, it is only necessary for you to return the length.

Your algorithm should run in O(n2) complexity.

比较复杂的办法，记录下每个以k为结尾的子序列Fk。

public class Solution {
    public int lengthOfLIS(int[] nums) {
        if(nums.length==0||nums.length==1){
            return nums.length;
        }
        TreeSet<LinkedList<Integer>> set=new TreeSet<>(new Comparator<LinkedList<Integer>>() {
            public int compare(LinkedList<Integer> o1, LinkedList<Integer> o2) {
                if(o1.size()<o2.size())
                return 1;
                else return -1;
            }
        });
        for(int t:nums){
            boolean flag=true;
            for(LinkedList<Integer> list:set){
                if(list.getLast()<t){
                    LinkedList<Integer> c=new LinkedList<>(list);
                    c.add(t);
                    set.add(c);
                    flag=false;
                    break;
                }
            }
            if(flag){
                LinkedList<Integer> l=new LinkedList<>();
                l.add(t);
                set.add(l);
            }
        }
        return set.first().size();
    }
}

每遇到一个数，将它替换到合适的位置。这种方法与题334类似。

若nums：3，4，1，2，3.

每次for循环之后 dp的结果如下：

[3]
[3, 4]
[1, 4]
[1, 2]
[1, 2, 3]

public class Solution {
    public int lengthOfLIS(int[] nums) {
        ArrayList<Integer> dp = new ArrayList<>(nums.length);
        for (int num : nums) {
            if (dp.size() == 0 || dp.get(dp.size()-1) < num) dp.add(num);
            else {
                int i = Collections.binarySearch(dp, num);
                dp.set((i<0) ? -i-1 : i, num);
            }
            System.out.println(dp);
        }
        return dp.size();
    }
}