lavos/cap4/ex28.go

package cap4

// Ex28 最长不下降子序列
func Ex28(nums []int) int {
	dp := make([]int, len(nums))

	for i := 0; i < len(nums); i++ {
		dp[i] = 1
		for j := 0; j < len(nums); j++ {
			if nums[i] > nums[j] {
				dp[i] = max(dp[i], dp[j]+1)
			}
		}
	}

	return dp[len(dp)-1]
}