dp求最长递增子序列并输出

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * Created  on 2016/4/26.
 */
public class Testdp {

    public static void main(String[] args) {
        new Testdp().getLIS();
    }

    public void getLIS() {
        List<Integer> nums = null;
        Integer[] numArray = {1, 4, 8, 1, 2, 3, 5};
        nums = Arrays.asList(numArray); //输入的数据
        int len = nums.size();

        String[] result = new String[len]; // 用来存储输出字符串
        int dp[] = new int[len];

        for (int i = 0; i < len; ++i) {
            dp[i] = 1;
            result[i] = "" + nums.get(i);

            for(int j=0; j<i; ++j) {
                if (nums.get(j) < nums.get(i) && dp[j] + 1 > dp[i]) {
                    result[i] = result[j] + " " +  nums.get(i);
                    dp[i] = dp[j] + 1;
                }
            }
        }

        int maxLen = 0;
        int maxIndex = 0;
        for(int i=0; i<len; ++i) {
            if (maxLen < dp[i]) {
                maxLen = dp[i];
                maxIndex = i;
            }
        }
        System.out.println(result[maxIndex]);
        System.out.println(maxLen);

    }

}