Golang Leetcode 334. Increasing Triplet Subsequence.go

版权声明：原创勿转 https://blog.csdn.net/anakinsun/article/details/89068924

思路

dp算法

code

func increasingTriplet(nums []int) bool {
	return helper(nums, 3)
}

func helper(nums []int, k int) bool {
	if len(nums) < k {
		return false
	}
	dp := make([]int, k+1)
	dp[0] = math.MinInt32
	dp[1] = nums[0]
	maxLen := 1
	for i := 1; i < len(nums); i++ {
		for j := maxLen; j >= 0; j-- {
			if nums[i] > dp[j] {
				if j == maxLen {
					maxLen++
					if maxLen == k {
						return true
					}
				}
				dp[j+1] = nums[i]
				break
			}
		}
	}
	return false
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode