algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 08:27:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0978 solution

Browse Source
This commit is contained in:
YDZ
2020-11-25 00:46:59 +08:00
parent 37fde650a5
commit 4384f0d468
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/0978.Longest-Turbulent-Subarray/978. Longest Turbulent Subarray.go
View File

@ -47,7 +47,7 @@ func maxTurbulenceSize1(A []int) int {
flag = lastNum - A[right] flag = lastNum - A[right]
lastNum = A[right] lastNum = A[right]
} else { } else {
if right != left && flag != 0 { if flag != 0 {
res = max(res, right-left+1) res = max(res, right-left+1)
} }
left++ left++

2
website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md
View File

@ -97,7 +97,7 @@ func maxTurbulenceSize1(A []int) int {
flag = lastNum - A[right] flag = lastNum - A[right]
lastNum = A[right] lastNum = A[right]
} else { } else {
if right != left && flag != 0 { if flag != 0 {
res = max(res, right-left+1) res = max(res, right-left+1)
} }
left++ left++