HTMLify
LeetCode - Longest Strictly Increasing or Strictly Decreasing Subarray - Go
Views: 358 | Author: abh
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 26 27 28 29 30 31 32 33 | func longestMonotonicSubarray(nums []int) int { l := 0 le := 0 ci := 0 for _, v := range nums { if v > le { ci++ } else { ci = 1 } le = v if ci > l { l = ci } } le = 51 cd := 0 for _, v := range nums { if v < le { cd++ } else { cd = 1 } le = v if cd > l { l = cd } } return l } |