Skip to content

Commit f9eadc7

ovidiubute ovidiubute

committed

Implement 153 in O(log(n)).

1 parent 9fc54fe commit f9eadc7Copy full SHA for f9eadc7

File tree

1 file changed

+31

-5

lines changed

solutions
- 0153.find-minimum-in-rotated-sorted-array.js

1 file changed

+31

-5

lines changed

`‎solutions/0153.find-minimum-in-rotated-sorted-array.js`

Lines changed: 31 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,11 +3,37 @@`
`3`	`3`	`* @return {number}`
`4`	`4`	`*/`
`5`	`5`	`var findMin = function (nums) {`
`6`		`- for (let i = 1; i < nums.length; i++) {`
`7`		`- if (nums[i - 1] > nums[i]) {`
`8`		`- return nums[i];`
`9`		`- }`
	`6`	`+ const n = nums.length;`
	`7`	`+`
	`8`	`+ if (n === 0) {`
	`9`	`+ return 0;`
	`10`	`+ } else if (n === 1) {`
	`11`	`+ return nums[0];`
	`12`	`+ } else if (nums[0] < nums[n - 1]) {`
	`13`	`+ return nums[0];`
`10`	`14`	`}`
`11`	`15`
`12`		`- return nums[0];`
	`16`	`+ let lo = 0,`
	`17`	`+ hi = n - 1;`
	`18`	`+`
	`19`	`+ while (lo <= hi) {`
	`20`	`+ const mid = Math.floor((lo + hi) / 2);`
	`21`	`+`
	`22`	`+ if (nums[mid] > nums[mid + 1]) {`
	`23`	`+ return nums[mid + 1];`
	`24`	`+ }`
	`25`	`+`
	`26`	`+ if (nums[mid - 1] > nums[mid]) {`
	`27`	`+ return nums[mid];`
	`28`	`+ }`
	`29`	`+`
	`30`	`+ if (nums[mid] < nums[0]) {`
	`31`	`+ hi = mid - 1;`
	`32`	`+ } else {`
	`33`	`+ lo = mid + 1;`
	`34`	`+ }`
	`35`	`+ }`
`13`	`36`	`};`
	`37`	`+`
	`38`	`+const nums = [3, 4, 5, 1, 2];`
	`39`	`+findMin(nums);`

0 commit comments

Comments

(0)