最长递增子序列 ~ 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 package main func main() { } // O(n2) func lengthOfLIS(nums []int) int { res := math.MinInt dp := make([]int,len(nums)) for i := 0 ; i < len(nums) ; i++ { dp[i] = 1 } for i :=

判断 nums 中是否存在某个子序列之和等于 k ~ 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 func main() { a := []int{4, 1, 2, 4, 7} res := IsContainNumTotalK(a, 20) fmt.Println(res) } func IsContainNumTotalK(nums []int, k int) bool { if k == 0 { return true } else