Commit955b4d9

committed

refactor 650

1 parent23e60ed commit955b4d9Copy full SHA for 955b4d9

File tree

+19

-17

lines changed

src
- main/java/com/fishercoder/solutions
  - _650.java
- test/java/com/fishercoder
  - _650Test.java

+19

-17

lines changed

Lines changed: 12 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -24,18 +24,20 @@`
`24`	`24`	`*/`
`25`	`25`	`publicclass_650 {`
`26`	`26`
`27`		`-publicintminSteps(intn) {`
`28`		`-int[]dp =newint[n +1];`
`29`		`-for (inti =2;i <=n;i++) {`
`30`		`-dp[i] =i;//we assign i to dp[i] first, because for a lot of cases, e.g. for most cases when i is odd, its min steps is i itself, if it's not, we can overwrite it later`
`31`		`-for (intj =i -1;j >1;j--) {`
`32`		`-//traverse backwards, whenever it's divisible by j, we'll update dp[i] because it's guaranteed to be smaller when j is smaller.`
`33`		`-if (i %j ==0) {`
`34`		`-dp[i] =dp[j] + (i /j);`
`35`		`-break;`
	`27`	`+publicstaticclassSolution1 {`
	`28`	`+publicintminSteps(intn) {`
	`29`	`+int[]dp =newint[n +1];`
	`30`	`+for (inti =2;i <=n;i++) {`
	`31`	`+dp[i] =i;//we assign i to dp[i] first, because for a lot of cases, e.g. for most cases when i is odd, its min steps is i itself, if it's not, we can overwrite it later`
	`32`	`+for (intj =i -1;j >1;j--) {`
	`33`	`+//traverse backwards, whenever it's divisible by j, we'll update dp[i] because it's guaranteed to be smaller when j is smaller.`
	`34`	`+if (i %j ==0) {`
	`35`	`+dp[i] =dp[j] + (i /j);`
	`36`	`+break;`
	`37`	`+ }`
`36`	`38`	`}`
`37`	`39`	`}`
	`40`	`+returndp[n];`
`38`	`41`	`}`
`39`		`-returndp[n];`
`40`	`42`	`}`
`41`	`43`	`}`

Lines changed: 7 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,35 +7,35 @@`
`7`	`7`	`importstaticorg.junit.Assert.assertEquals;`
`8`	`8`
`9`	`9`	`publicclass_650Test {`
`10`		`-privatestatic_650test;`
	`10`	`+privatestatic_650.Solution1solution1;`
`11`	`11`
`12`	`12`	`@BeforeClass`
`13`	`13`	`publicstaticvoidsetup() {`
`14`		`-test =new_650();`
	`14`	`+solution1 =new_650.Solution1();`
`15`	`15`	`}`
`16`	`16`
`17`	`17`	`@Test`
`18`	`18`	`publicvoidtest1() {`
`19`		`-assertEquals(3,test.minSteps(3));`
	`19`	`+assertEquals(3,solution1.minSteps(3));`
`20`	`20`	`}`
`21`	`21`
`22`	`22`	`@Test`
`23`	`23`	`publicvoidtest2() {`
`24`		`-assertEquals(9,test.minSteps(20));`
	`24`	`+assertEquals(9,solution1.minSteps(20));`
`25`	`25`	`}`
`26`	`26`
`27`	`27`	`@Test`
`28`	`28`	`publicvoidtest3() {`
`29`		`-assertEquals(19,test.minSteps(19));`
	`29`	`+assertEquals(19,solution1.minSteps(19));`
`30`	`30`	`}`
`31`	`31`
`32`	`32`	`@Test`
`33`	`33`	`publicvoidtest4() {`
`34`		`-assertEquals(0,test.minSteps(1));`
	`34`	`+assertEquals(0,solution1.minSteps(1));`
`35`	`35`	`}`
`36`	`36`
`37`	`37`	`@Test`
`38`	`38`	`publicvoidtest5() {`
`39`		`-assertEquals(35,test.minSteps(741));`
	`39`	`+assertEquals(35,solution1.minSteps(741));`
`40`	`40`	`}`
`41`	`41`	`}`

Comments

(0)