最长上升子序列

public class Solution {
    /**
     * @param nums: The integer array
     * @return: The length of LIS (longest increasing subsequence)
     */
    public int longestIncreasingSubsequence(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        
        int[] lis = new int[nums.length];
        int max = 0;
        for (int i = 0; i < nums.length; i++) {
            int tempMax = 0;
            for (int j = 0; j < i; j++) {
                if (lis[j] > tempMax && nums[j] < nums[i])
                    tempMax = lis[j];
            }
            
            lis[i] = tempMax + 1;
            
            max = lis[i] > max ? lis[i] : max;
        }
        return max;
    }
}