-
Notifications
You must be signed in to change notification settings - Fork 54
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
find minimum in rotated sorted array solution
- Loading branch information
1 parent
0720200
commit 6552aef
Showing
1 changed file
with
23 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,23 @@ | ||
class Solution { | ||
public int findMin(int[] nums) { | ||
// TC: O(log N) | ||
// SC: O(1) | ||
var left = 1; // N๋ฒ ํ์ ํด ์ด๋ฏธ ์ค๋ฆ์ฐจ์ ์ ๋ ฌ์ผ ๊ฒฝ์ฐ 0์ผ๋ก ์์ํ๋ฉด ๋ฃจํ๊ฐ ์๋๋จ. 1๋ก ์์ | ||
var right = nums.length-1; | ||
|
||
while (left <= right) { // left๊ฐ right๋ณด๋ค ์๊ฑฐ๋ ๊ฐ์๋๊น์ง | ||
var mid = (left + right) / 2; | ||
if (nums[mid - 1] > nums[mid]) { // mid - 1 ์์๊ฐ mid ๋ณด๋ค ๊ฐ์ด ํฌ๋ฉด ๋ณ๊ณก์ ์ ์ฐพ์ ๊ฒ. ๊ทธ๋๋ก ๋ฐํ | ||
return nums[mid]; | ||
} | ||
|
||
if (nums[mid] > nums[0]) { // ๋ณ๊ณก์ ์ด ์๋๊ณ , 0๋ฒ์งธ ์ธ๋ฑ์ค๋ณด๋ค mid ์์๊ฐ ๊ฐ์ด ํฌ๋ฉด ์ ๋ ฌ์ด ์ ๋์ด ์๋๊ฒ. ์ค๋ฅธ์ชฝ์ผ๋ก ํ์ | ||
left = mid + 1; | ||
} else { | ||
right = mid - 1; | ||
} | ||
} | ||
|
||
return nums[0]; // N๋ฒ ํ์ ํด ์ด๋ฏธ ์ค๋ฆ์ฐจ์ ์ ๋ ฌ์ผ ๊ฒฝ์ฐ 0๋ฒ์งธ ์ธ๋ฑ์ค ์์ ๋ฐํ | ||
} | ||
} |