Skip to content

Commit 85aef7c

Browse files
committed
2. Find Minimum in Rotated Sorted Array
1 parent 21cd0ff commit 85aef7c

File tree

1 file changed

+32
-0
lines changed

1 file changed

+32
-0
lines changed
Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
/**
2+
* @description
3+
* brainstorming:
4+
* brute force
5+
*
6+
* n = length of head
7+
* time complexity: O(n)
8+
* space complexity: O(1)
9+
*/
10+
var findMin = function (nums) {
11+
let answer = 5000;
12+
nums.forEach((num) => (answer = Math.min(answer, num)));
13+
14+
return answer;
15+
};
16+
17+
/* n = length of head
18+
* time complexity: O(n)
19+
* space complexity: O(1)
20+
*/
21+
var findMin = function (nums) {
22+
let answer = nums[0];
23+
if (nums.length === 1) return answer;
24+
if (answer < nums[nums.length - 1]) return answer;
25+
26+
for (let i = nums.length - 1; i >= 0; i--) {
27+
if (answer < nums[i]) return answer;
28+
answer = nums[i];
29+
}
30+
31+
return answer;
32+
};

0 commit comments

Comments
 (0)