最长连续递增序列-贪心算法-基于Go
2021/4/8 12:38:25
本文主要是介绍最长连续递增序列-贪心算法-基于Go,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
给定一个未经排序的整数数组,找到最长且连续递增的子序列,并返回该序列的长度。
如:
[1,2,3,2,3,4,3,4,5,6,7]
返回5.
- 贪心算法
func findLength(nums []int)int{ var start = 0 var maxLength = 0 for i:=1;i<len(nums);i++{ if nums[i]<=nums[i-1]{ start = i } maxLength = int(math.Max(float64(maxLength), float64(i-start+1))) } return maxLength }
- 双指针
func findLength2(nums []int)int{ var low = 0 var high = 1 var n = len(nums) var maxLength = 0 for low<n && high<n{ if nums[high]<=nums[high-1]{ low = high } maxLength = int(math.Max(float64(high-low+1), float64(maxLength))) high++ } return maxLength }
这篇关于最长连续递增序列-贪心算法-基于Go的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-04-01got an unexpected keyword argument
- 2024-03-30维多利亚的秘密 golang入坑系统
- 2024-03-29mongodb sort by date
- 2024-03-29go swagger
- 2024-03-25mongodb cdc
- 2024-03-25how to use go in vscode
- 2024-03-22mongooseserverselectionerror: connect econnrefused ::1:27017
- 2024-03-21pymongo insert_many
- 2024-03-18projection mongodb
- 2024-03-14clickhouse-go