Commitc5d360c

committed

refactor 153

1 parent19492cb commitc5d360cCopy full SHA for c5d360c

File tree

2 files changed

+79

-81

lines changed

src
- main/java/com/fishercoder/solutions
  - _153.java
- test/java/com/fishercoder
  - _153Test.java

2 files changed

+79

-81

lines changed

`‎src/main/java/com/fishercoder/solutions/_153.java`

Lines changed: 22 additions & 40 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,46 +1,28 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`		`-/**`
`4`		`- * 153. Find Minimum in Rotated Sorted Array`
`5`		`-`
`6`		`- Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.`
`7`		`-`
`8`		`- (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).`
`9`		`-`
`10`		`- Find the minimum element.`
`11`		`-`
`12`		`- You may assume no duplicate exists in the array.`
`13`		`-`
`14`		`- Example 1:`
`15`		`- Input: [3,4,5,1,2]`
`16`		`- Output: 1`
`17`		`-`
`18`		`- Example 2:`
`19`		`- Input: [4,5,6,7,0,1,2]`
`20`		`- Output: 0`
`21`		`-`
`22`		`- */`
`23`	`3`	`publicclass_153 {`
`24`		`-publicstaticclassSolution1 {`
`25`		`-publicintfindMin(int[]nums) {`
`26`		`-intleft =0;`
`27`		`-intright =nums.length -1;`
`28`		`-if (nums[left] <nums[right]) {`
`29`		`-returnnums[left];`
`30`		`- }`
`31`		`-intmin =nums[0];`
`32`		`-while (left +1 <right) {`
`33`		`-intmid =left + (right -left) /2;`
`34`		`-min =Math.min(min,nums[mid]);`
`35`		`-if (nums[mid] >nums[left]) {`
`36`		`-min =Math.min(nums[left],min);`
`37`		`-left =mid +1;`
`38`		`- }elseif (nums[mid] <nums[left]) {`
`39`		`-right =mid -1;`
	`4`	`+publicstaticclassSolution1 {`
	`5`	`+/**`
	`6`	`+ * My completely original solution on 10/23/2021.`
	`7`	`+ */`
	`8`	`+publicintfindMin(int[]nums) {`
	`9`	`+intleft =0;`
	`10`	`+intright =nums.length -1;`
	`11`	`+while (left <right) {`
	`12`	`+intmid =left + (right -left) /2;`
	`13`	`+if (mid ==left \|\|mid ==right) {`
	`14`	`+//this is to avoid infinite loop`
	`15`	`+break;`
	`16`	`+ }`
	`17`	`+if (nums[mid] >nums[left] &&nums[mid] >nums[right]) {`
	`18`	`+left =mid +1;`
	`19`	`+ }elseif (nums[mid] <nums[right] &&nums[mid] >nums[left]) {`
	`20`	`+right =mid -1;`
	`21`	`+ }elseif (nums[mid] <nums[left] &&nums[mid] <nums[right]) {`
	`22`	`+right =mid;`
	`23`	`+ }`
	`24`	`+ }`
	`25`	`+returnright >=0 ? (nums[left] <nums[right] ?nums[left] :nums[right]) :nums[left];`
`40`	`26`	`}`
`41`		`- }`
`42`		`-min =Math.min(min,Math.min(nums[left],nums[right]));`
`43`		`-returnmin;`
`44`	`27`	`}`
`45`		`- }`
`46`	`28`	`}`

`‎src/test/java/com/fishercoder/_153Test.java`

Lines changed: 57 additions & 41 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,45 +7,61 @@`
`7`	`7`	`importstaticorg.junit.Assert.assertEquals;`
`8`	`8`
`9`	`9`	`publicclass_153Test {`
`10`		`-privatestatic_153.Solution1solution1;`
`11`		`-privatestaticintexpected;`
`12`		`-privatestaticintactual;`
`13`		`-privatestaticint[]nums;`
`14`		`-`
`15`		`-@BeforeClass`
`16`		`-publicstaticvoidsetup() {`
`17`		`-solution1 =new_153.Solution1();`
`18`		`- }`
`19`		`-`
`20`		`-@Test`
`21`		`-publicvoidtest1() {`
`22`		`-nums =newint[] {4,5,6,7,0,1,2};`
`23`		`-expected =0;`
`24`		`-actual =solution1.findMin(nums);`
`25`		`-assertEquals(expected,actual);`
`26`		`- }`
`27`		`-`
`28`		`-@Test`
`29`		`-publicvoidtest2() {`
`30`		`-nums =newint[] {1};`
`31`		`-expected =1;`
`32`		`-actual =solution1.findMin(nums);`
`33`		`-assertEquals(expected,actual);`
`34`		`- }`
`35`		`-`
`36`		`-@Test`
`37`		`-publicvoidtest3() {`
`38`		`-nums =newint[] {2,1};`
`39`		`-expected =1;`
`40`		`-actual =solution1.findMin(nums);`
`41`		`-assertEquals(expected,actual);`
`42`		`- }`
`43`		`-`
`44`		`-@Test`
`45`		`-publicvoidtest4() {`
`46`		`-nums =newint[] {2,3,4,5,1};`
`47`		`-expected =1;`
`48`		`-actual =solution1.findMin(nums);`
`49`		`-assertEquals(expected,actual);`
`50`		`- }`
	`10`	`+privatestatic_153.Solution1solution1;`
	`11`	`+privatestaticintexpected;`
	`12`	`+privatestaticint[]nums;`
	`13`	`+`
	`14`	`+@BeforeClass`
	`15`	`+publicstaticvoidsetup() {`
	`16`	`+solution1 =new_153.Solution1();`
	`17`	`+ }`
	`18`	`+`
	`19`	`+@Test`
	`20`	`+publicvoidtest1() {`
	`21`	`+nums =newint[]{4,5,6,7,0,1,2};`
	`22`	`+expected =0;`
	`23`	`+assertEquals(expected,solution1.findMin(nums));`
	`24`	`+ }`
	`25`	`+`
	`26`	`+@Test`
	`27`	`+publicvoidtest2() {`
	`28`	`+nums =newint[]{1};`
	`29`	`+expected =1;`
	`30`	`+assertEquals(expected,solution1.findMin(nums));`
	`31`	`+ }`
	`32`	`+`
	`33`	`+@Test`
	`34`	`+publicvoidtest3() {`
	`35`	`+nums =newint[]{2,1};`
	`36`	`+expected =1;`
	`37`	`+assertEquals(expected,solution1.findMin(nums));`
	`38`	`+ }`
	`39`	`+`
	`40`	`+@Test`
	`41`	`+publicvoidtest4() {`
	`42`	`+nums =newint[]{2,3,4,5,1};`
	`43`	`+expected =1;`
	`44`	`+assertEquals(expected,solution1.findMin(nums));`
	`45`	`+ }`
	`46`	`+`
	`47`	`+@Test`
	`48`	`+publicvoidtest5() {`
	`49`	`+nums =newint[]{3,1,2};`
	`50`	`+expected =1;`
	`51`	`+assertEquals(expected,solution1.findMin(nums));`
	`52`	`+ }`
	`53`	`+`
	`54`	`+@Test`
	`55`	`+publicvoidtest6() {`
	`56`	`+nums =newint[]{3,4,5,1,2};`
	`57`	`+expected =1;`
	`58`	`+assertEquals(expected,solution1.findMin(nums));`
	`59`	`+ }`
	`60`	`+`
	`61`	`+@Test`
	`62`	`+publicvoidtest7() {`
	`63`	`+nums =newint[]{5,1,2,3,4};`
	`64`	`+expected =1;`
	`65`	`+assertEquals(expected,solution1.findMin(nums));`
	`66`	`+ }`
`51`	`67`	`}`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commitc5d360c

File tree

2 files changed

2 files changed

`‎src/main/java/com/fishercoder/solutions/_153.java`

`‎src/test/java/com/fishercoder/_153Test.java`

0 commit comments