Commit4c0f6a9

committed

refactor 713

1 parent7cbfdbb commit4c0f6a9Copy full SHA for 4c0f6a9

File tree

-27

lines changed

src
- main/java/com/fishercoder/solutions
  - _713.java
- test/java/com/fishercoder
  - _713Test.java

-27

lines changed

Lines changed: 0 additions & 24 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,30 +2,6 @@`
`2`	`2`
`3`	`3`	`publicclass_713 {`
`4`	`4`	`publicstaticclassSolution1 {`
`5`		`-/**`
`6`		`- * O(n^2) solution, accepted initially, then Leetcode added one test case to fail it.`
`7`		`- */`
`8`		`-publicintnumSubarrayProductLessThanK(int[]nums,intk) {`
`9`		`-intresult =0;`
`10`		`-for (inti =0;i <nums.length;i++) {`
`11`		`-intproduct =nums[i];`
`12`		`-if (product <k) {`
`13`		`-result++;`
`14`		`-for (intj =i +1;j <nums.length;j++) {`
`15`		`-product *=nums[j];`
`16`		`-if (product <k) {`
`17`		`-result++;`
`18`		`- }else {`
`19`		`-break;`
`20`		`- }`
`21`		`- }`
`22`		`- }`
`23`		`- }`
`24`		`-returnresult;`
`25`		`- }`
`26`		`- }`
`27`		`-`
`28`		`-publicstaticclassSolution2 {`
`29`	`5`	`publicintnumSubarrayProductLessThanK(int[]nums,intk) {`
`30`	`6`	`if (k <2) {`
`31`	`7`	`return0;`

Lines changed: 0 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,21 +8,18 @@`
`8`	`8`
`9`	`9`	`publicclass_713Test {`
`10`	`10`	`privatestatic_713.Solution1solution1;`
`11`		`-privatestatic_713.Solution2solution2;`
`12`	`11`	`privatestaticint[]nums;`
`13`	`12`	`privatestaticintk;`
`14`	`13`
`15`	`14`	`@BeforeClass`
`16`	`15`	`publicstaticvoidsetup() {`
`17`		`-solution2 =new_713.Solution2();`
`18`	`16`	`solution1 =new_713.Solution1();`
`19`	`17`	`}`
`20`	`18`
`21`	`19`	`@Test`
`22`	`20`	`publicvoidtest1() {`
`23`	`21`	`nums =newint[]{1,2,3};`
`24`	`22`	`k =0;`
`25`		`-assertEquals(0,solution2.numSubarrayProductLessThanK(nums,k));`
`26`	`23`	`assertEquals(0,solution1.numSubarrayProductLessThanK(nums,k));`
`27`	`24`	`}`
`28`	`25`

Comments

(0)