Skip to content

Commit 4db46da

wisdompeak wisdompeak

authored

Update 978.Longest-Turbulent-Subarray.cpp

1 parent 837f69e commit 4db46daCopy full SHA for 4db46da

File tree

1 file changed

+13

-13

lines changed

Others/978.Longest-Turbulent-Subarray
- 978.Longest-Turbulent-Subarray.cpp

1 file changed

+13

-13

lines changed

`‎Others/978.Longest-Turbulent-Subarray/978.Longest-Turbulent-Subarray.cpp‎`

Lines changed: 13 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,23 +11,23 @@ class Solution {`
`11`	`11`	`else if (A[i]<A[i+1])`
`12`	`12`	`q[i] = 1;`
`13`	`13`	`}`
`14`		`-`
`15`		`- if (A.size()==1) return 1;`
`16`		`- if (A.size()==2) return q[0]==0? 1: 2;`
`17`		`-`
`18`		`- int count = 1;`
`19`		`- int start = 0;`
`20`		`- for (int i=0; i+1<A.size()-1; i++)`
	`14`	`+`
	`15`	`+ int count = 1;`
	`16`	`+ int i = 0;`
	`17`	`+ while (i<q.size())`
`21`	`18`	`{`
`22`		`- if (q[i]!=0)`
`23`		`- count = max(count, 2);`
`24`		`-`
`25`		`- start = i;`
`26`		`- while (i+1<A.size()-1 && q[i]*q[i+1]==-1)`
	`19`	`+ if (q[i]==0)`
`27`	`20`	`{`
`28`	`21`	`i++;`
`29`		`- count = max(count, i-start+2);`
	`22`	`+ continue;`
`30`	`23`	`}`
	`24`	`+`
	`25`	`+ int start = i;`
	`26`	`+ while (i+1<q.size() && q[i]*q[i+1]==-1)`
	`27`	`+ i++;`
	`28`	`+`
	`29`	`+ count = max(count, i-start+1+1);`
	`30`	`+ i++;`
`31`	`31`	`}`
`32`	`32`
`33`	`33`	`return count;`

0 commit comments

Comments

(0)