Commitcdfb367

committed

fix build

1 parent4a6cc58 commitcdfb367Copy full SHA for cdfb367

File tree

+21

-21

lines changed

src
- main/java/com/fishercoder/solutions
  - _1283.java
- test/java/com/fishercoder
  - _1283Test.java

+21

-21

lines changed

Lines changed: 17 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,32 +1,33 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`	`3`	`publicclass_1283 {`
`4`		`-publicstaticclassSolution{`
`5`		`-privatebooleanisSumLessThanThreshold(intmiddle,int[]nums,intthreshold){`
`6`		`-intsum =0;`
`7`		`-for(inti =0;i<nums.length;i++){`
`8`		`-if(nums[i] %middle ==0)`
`9`		`-sum +=nums[i]/middle;`
`10`		`-else`
`11`		`-sum +=nums[i]/middle +1;`
`12`		`- }`
`13`		`-returnsum <=threshold;`
`14`		`- }`
	`4`	`+publicstaticclassSolution {`
	`5`	`+`
`15`	`6`	`publicintsmallestDivisor(int[]nums,intthreshold) {`
`16`	`7`
`17`	`8`	`intstart =1,result =0;`
`18`	`9`	`intend =Integer.MAX_VALUE;`
`19`		`-while(start <=end){`
`20`		`-intmiddle =start + (end -start)/2;`
`21`		`-if(isSumLessThanThreshold(middle,nums,threshold)){`
	`10`	`+while(start <=end){`
	`11`	`+intmiddle =start + (end -start) /2;`
	`12`	`+if(isSumLessThanThreshold(middle,nums,threshold)){`
`22`	`13`	`result =middle;`
`23`	`14`	`end =middle -1;`
`24`		`- }`
`25`		`-else{`
	`15`	`+ }else {`
`26`	`16`	`start =middle +1;`
`27`	`17`	`}`
`28`	`18`	`}`
`29`	`19`	`returnresult;`
`30`	`20`	`}`
	`21`	`+`
	`22`	`+privatebooleanisSumLessThanThreshold(intmiddle,int[]nums,intthreshold) {`
	`23`	`+intsum =0;`
	`24`	`+for (inti =0;i <nums.length;i++) {`
	`25`	`+if (nums[i] %middle ==0)`
	`26`	`+sum +=nums[i] /middle;`
	`27`	`+else`
	`28`	`+sum +=nums[i] /middle +1;`
	`29`	`+ }`
	`30`	`+returnsum <=threshold;`
	`31`	`+ }`
`31`	`32`	`}`
`32`	`33`	`}`

Lines changed: 4 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,32 +1,31 @@`
`1`	`1`	`packagecom.fishercoder;`
`2`	`2`
`3`		`-importcom.fishercoder.common.utils.TreeUtils;`
`4`	`3`	`importcom.fishercoder.solutions._1283;`
`5`	`4`	`importorg.junit.BeforeClass;`
`6`	`5`	`importorg.junit.Test;`
`7`	`6`
`8`		`-importjava.util.Arrays;`
`9`		`-`
`10`	`7`	`importstaticjunit.framework.TestCase.assertEquals;`
`11`	`8`
`12`	`9`	`publicclass_1283Test {`
`13`	`10`	`privatestatic_1283.Solutionsolution;`
`14`	`11`	`privatestaticint[]nums;`
`15`	`12`	`privatestaticintthreshold;`
	`13`	`+`
`16`	`14`	`@BeforeClass`
`17`	`15`	`publicstaticvoidsetup() {`
`18`	`16`	`solution =new_1283.Solution();`
`19`	`17`	`}`
`20`	`18`
`21`	`19`	`@Test`
`22`	`20`	`publicvoidtest1() {`
`23`		`-nums =newint[]{1,2,5,9};`
	`21`	`+nums =newint[]{1,2,5,9};`
`24`	`22`	`threshold =6;`
`25`	`23`	`assertEquals(5,solution.smallestDivisor(nums,threshold));`
`26`	`24`	`}`
	`25`	`+`
`27`	`26`	`@Test`
`28`	`27`	`publicvoidtest2() {`
`29`		`-nums =newint[]{2,3,5,7,11};`
	`28`	`+nums =newint[]{2,3,5,7,11};`
`30`	`29`	`threshold =11;`
`31`	`30`	`assertEquals(3,solution.smallestDivisor(nums,threshold));`
`32`	`31`	`}`

Comments

(0)