Commit 8aa3cc3

author

Sandy

authored

Merge pull request #189 from openset/develop

Add: Max Consecutive Ones

2 parents 2a3f6ed + 79fdb21 commit 8aa3cc3Copy full SHA for 8aa3cc3

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,16 @@`
`1`	`1`	`package max_consecutive_ones`
	`2`	`+`
	`3`	`+func findMaxConsecutiveOnes(nums []int) int {`
	`4`	`+ ans, count := 0, 0`
	`5`	`+ for _, v := range nums {`
	`6`	`+ if v == 1 {`
	`7`	`+ count++`
	`8`	`+ if count > ans {`
	`9`	`+ ans = count`
	`10`	`+ }`
	`11`	`+ } else {`
	`12`	`+ count = 0`
	`13`	`+ }`
	`14`	`+ }`
	`15`	`+ return ans`
	`16`	`+}`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,27 @@`
`1`	`1`	`package max_consecutive_ones`
	`2`	`+`
	`3`	`+import "testing"`
	`4`	`+`
	`5`	`+type caseType struct {`
	`6`	`+ input []int`
	`7`	`+ expected int`
	`8`	`+}`
	`9`	`+`
	`10`	`+func TestFindMaxConsecutiveOnes(t *testing.T) {`
	`11`	`+ tests := [...]caseType{`
	`12`	`+ {`
	`13`	`+ input: []int{1, 1, 0, 1, 1, 1},`
	`14`	`+ expected: 3,`
	`15`	`+ },`
	`16`	`+ {`
	`17`	`+ input: []int{1, 0, 1, 1, 0, 1},`
	`18`	`+ expected: 2,`
	`19`	`+ },`
	`20`	`+ }`
	`21`	`+ for _, tc := range tests {`
	`22`	`+ output := findMaxConsecutiveOnes(tc.input)`
	`23`	`+ if output != tc.expected {`
	`24`	`+ t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+}`

Comments

(0)