Commit2d0a81b

committed

add a solution for 485

1 parent263e0d8 commit2d0a81bCopy full SHA for 2d0a81b

File tree

+25

-0

lines changed

src
- main/java/com/fishercoder/solutions
  - _485.java
- test/java/com/fishercoder
  - _485Test.java

+25

-0

lines changed

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,4 +15,26 @@ public int findMaxConsecutiveOnes(int[] nums) {`
`15`	`15`	`returnmaxLen;`
`16`	`16`	`}`
`17`	`17`	`}`
	`18`	`+`
	`19`	`+publicstaticclassSolution2 {`
	`20`	`+/**`
	`21`	`+ * Apply the sliding window template, i.e. two pointer technique.`
	`22`	`+ */`
	`23`	`+publicintfindMaxConsecutiveOnes(int[]nums) {`
	`24`	`+intleft =0;`
	`25`	`+intright =0;`
	`26`	`+intans =0;`
	`27`	`+while (right <nums.length) {`
	`28`	`+while (right <nums.length &&nums[right] ==1) {`
	`29`	`+right++;`
	`30`	`+ }`
	`31`	`+ans =Math.max(ans,right -left);`
	`32`	`+while (right <nums.length &&nums[right] !=1) {`
	`33`	`+right++;`
	`34`	`+ }`
	`35`	`+left =right;`
	`36`	`+ }`
	`37`	`+returnans;`
	`38`	`+ }`
	`39`	`+ }`
`18`	`40`	`}`

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,15 +8,18 @@`
`8`	`8`
`9`	`9`	`publicclass_485Test {`
`10`	`10`	`privatestatic_485.Solution1solution1;`
	`11`	`+privatestatic_485.Solution2solution2;`
`11`	`12`
`12`	`13`	`@BeforeClass`
`13`	`14`	`publicstaticvoidsetup() {`
`14`	`15`	`solution1 =new_485.Solution1();`
	`16`	`+solution2 =new_485.Solution2();`
`15`	`17`	`}`
`16`	`18`
`17`	`19`	`@Test`
`18`	`20`	`publicvoidtest1() {`
`19`	`21`	`assertEquals(3,solution1.findMaxConsecutiveOnes(newint[]{1,1,0,1,1,1}));`
	`22`	`+assertEquals(3,solution2.findMaxConsecutiveOnes(newint[]{1,1,0,1,1,1}));`
`20`	`23`	`}`
`21`	`24`
`22`	`25`	`}`

Comments

(0)