300. 最长递增子序列

func lengthOfLIS(nums []int) int {
    dp := make([]int, len(nums))
    max := 0
    for i:=0; i<len(nums); i++ {
        dp[i] = 1
        for j:=0; j<i; j++ {
            if nums[j] < nums[i] {
                if dp[i] < dp[j]+1 {
                    dp[i] = dp[j]+1
                }
            }
        }
        if max < dp[i] {
            max = dp[i]
        }
    }
    return max
}