Commitf5c89a0

committed

refactor 239

1 parent97357b8 commitf5c89a0Copy full SHA for f5c89a0

File tree

+21

-22

lines changed

src
- main/java/com/fishercoder/solutions
  - _239.java
- test/java/com/fishercoder
  - _239Test.java

+21

-22

lines changed

Lines changed: 18 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -35,24 +35,26 @@ How about using a data structure such as deque (double-ended queue)?`
`35`	`35`	`*/`
`36`	`36`	`publicclass_239 {`
`37`	`37`
`38`		`-publicint[]maxSlidingWindow(int[]nums,intk) {`
`39`		`-if (nums ==null \|\|nums.length ==0 \|\|k ==0) {`
`40`		`-returnnewint[0];`
`41`		`- }`
`42`		`-PriorityQueue<Integer>heap =newPriorityQueue<>((a,b) ->b -a);`
`43`		`-int[]res =newint[nums.length -k +1];`
`44`		`-for (inti =0;i <nums.length;i++) {`
`45`		`-if (i <k) {`
`46`		`-heap.offer(nums[i]);`
`47`		`-if (i ==k -1) {`
`48`		`-res[0] =heap.peek();`
	`38`	`+publicstaticclassSolution1 {`
	`39`	`+publicint[]maxSlidingWindow(int[]nums,intk) {`
	`40`	`+if (nums ==null \|\|nums.length ==0 \|\|k ==0) {`
	`41`	`+returnnewint[0];`
	`42`	`+ }`
	`43`	`+PriorityQueue<Integer>heap =newPriorityQueue<>((a,b) ->b -a);`
	`44`	`+int[]res =newint[nums.length -k +1];`
	`45`	`+for (inti =0;i <nums.length;i++) {`
	`46`	`+if (i <k) {`
	`47`	`+heap.offer(nums[i]);`
	`48`	`+if (i ==k -1) {`
	`49`	`+res[0] =heap.peek();`
	`50`	`+ }`
	`51`	`+ }else {`
	`52`	`+heap.remove(nums[i -k]);`
	`53`	`+heap.offer(nums[i]);`
	`54`	`+res[i -k +1] =heap.peek();`
`49`	`55`	`}`
`50`		`- }else {`
`51`		`-heap.remove(nums[i -k]);`
`52`		`-heap.offer(nums[i]);`
`53`		`-res[i -k +1] =heap.peek();`
`54`	`56`	`}`
	`57`	`+returnres;`
`55`	`58`	`}`
`56`		`-returnres;`
`57`	`59`	`}`
`58`	`60`	`}`

Lines changed: 3 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,19 +6,16 @@`
`6`	`6`	`importorg.junit.BeforeClass;`
`7`	`7`	`importorg.junit.Test;`
`8`	`8`
`9`		`-/**`
`10`		`- * Created by fishercoder on 1/10/17.`
`11`		`- */`
`12`	`9`	`publicclass_239Test {`
`13`		`-privatestatic_239test;`
	`10`	`+privatestatic_239.Solution1solution1;`
`14`	`11`	`privatestaticint[]expected;`
`15`	`12`	`privatestaticint[]actual;`
`16`	`13`	`privatestaticint[]nums;`
`17`	`14`	`privatestaticintk;`
`18`	`15`
`19`	`16`	`@BeforeClass`
`20`	`17`	`publicstaticvoidsetup() {`
`21`		`-test =new_239();`
	`18`	`+solution1 =new_239.Solution1();`
`22`	`19`	`}`
`23`	`20`
`24`	`21`	`@Before`
`@@ -35,7 +32,7 @@ public void test1() {`
`35`	`32`	`nums =newint[]{1,3, -1, -3,5,3,6,7};`
`36`	`33`	`k =3;`
`37`	`34`	`expected =newint[]{3,3,5,5,6,7};`
`38`		`-actual =test.maxSlidingWindow(nums,k);`
	`35`	`+actual =solution1.maxSlidingWindow(nums,k);`
`39`	`36`	`Assert.assertArrayEquals(expected,actual);`
`40`	`37`
`41`	`38`	`}`

Comments

(0)