Commit793a36e

committed

refactor 154

1 parent35b4331 commit793a36eCopy full SHA for 793a36e

File tree

+43

-25

lines changed

src
- main/java/com/fishercoder/solutions
  - _154.java
- test/java/com/fishercoder
  - _154Test.java

+43

-25

lines changed

Lines changed: 20 additions & 14 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,27 +2,33 @@`
`2`	`2`
`3`	`3`	`publicclass_154 {`
`4`	`4`	`publicstaticclassSolution1 {`
	`5`	`+/**`
	`6`	`+ * My completely original solution on 10/23/2021.`
	`7`	`+ * Again, using a pen and paper to visualize all possible cases helps a great deal!`
	`8`	`+ */`
`5`	`9`	`publicintfindMin(int[]nums) {`
`6`	`10`	`intleft =0;`
`7`	`11`	`intright =nums.length -1;`
`8`		`-if (nums[left] <nums[right]) {`
`9`		`-returnnums[left];`
`10`		`- }`
`11`		`-intmin =nums[0];`
`12`		`-while (left +1 <right) {`
	`12`	`+while (left <right) {`
	`13`	`+while (left +1 <right &&nums[left] ==nums[left +1]) {`
	`14`	`+left++;`
	`15`	`+ }`
	`16`	`+while (right -1 >left &&nums[right -1] ==nums[right]) {`
	`17`	`+right--;`
	`18`	`+ }`
`13`	`19`	`intmid =left + (right -left) /2;`
`14`		`-min =Math.min(min,nums[mid]);`
`15`		`-if (nums[mid] >nums[left]) {`
`16`		`-min =Math.min(nums[left],min);`
`17`		`-left =mid +1;`
	`20`	`+if (mid ==left \|\|mid ==right) {`
	`21`	`+break;`
	`22`	`+ }`
	`23`	`+if (nums[mid] <nums[right]) {`
	`24`	`+right =mid;`
`18`	`25`	`}elseif (nums[mid] <nums[left]) {`
`19`		`-right =mid -1;`
`20`		`- }else {`
`21`		`-left++;`
	`26`	`+left =mid;`
	`27`	`+ }elseif (nums[mid] >nums[right]){`
	`28`	`+left =mid +1;`
`22`	`29`	`}`
`23`	`30`	`}`
`24`		`-min =Math.min(min,Math.min(nums[left],nums[right]));`
`25`		`-returnmin;`
	`31`	`+returnright >=0 &&nums[right] <nums[left] ?nums[right] :nums[left];`
`26`	`32`	`}`
`27`	`33`	`}`
`28`	`34`	`}`

Lines changed: 23 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,17 +7,29 @@`
`7`	`7`	`importstaticorg.junit.Assert.assertEquals;`
`8`	`8`
`9`	`9`	`publicclass_154Test {`
`10`		`-privatestatic_154.Solution1solution1;`
`11`		`-privatestaticint[]nums;`
	`10`	`+privatestatic_154.Solution1solution1;`
	`11`	`+privatestaticint[]nums;`
`12`	`12`
`13`		`-@BeforeClass`
`14`		`-publicstaticvoidsetup() {`
`15`		`-solution1 =new_154.Solution1();`
`16`		`- }`
	`13`	`+@BeforeClass`
	`14`	`+publicstaticvoidsetup() {`
	`15`	`+solution1 =new_154.Solution1();`
	`16`	`+}`
`17`	`17`
`18`		`-@Test`
`19`		`-publicvoidtest1() {`
`20`		`-nums =newint[] {1,1,1};`
`21`		`-assertEquals(1,solution1.findMin(nums));`
`22`		`- }`
	`18`	`+@Test`
	`19`	`+publicvoidtest1() {`
	`20`	`+nums =newint[]{1,1,1};`
	`21`	`+assertEquals(1,solution1.findMin(nums));`
	`22`	`+ }`
	`23`	`+`
	`24`	`+@Test`
	`25`	`+publicvoidtest2() {`
	`26`	`+nums =newint[]{4,5,6,7,0,1,4};`
	`27`	`+assertEquals(0,solution1.findMin(nums));`
	`28`	`+ }`
	`29`	`+`
	`30`	`+@Test`
	`31`	`+publicvoidtest3() {`
	`32`	`+nums =newint[]{1,3,5};`
	`33`	`+assertEquals(1,solution1.findMin(nums));`
	`34`	`+ }`
`23`	`35`	`}`

Comments

(0)