We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 0b75e02 + f5d0e5e commit 707f3a6Copy full SHA for 707f3a6
Arrays/Rotatedarr.cpp
@@ -0,0 +1,30 @@
1
+class Solution {
2
+public:
3
+ int search(std::vector<int>& nums, int target) {
4
+ int low = 0, high = nums.size() - 1;
5
+
6
+ while (low <= high) {
7
+ int mid = (low + high) / 2;
8
9
+ if (nums[mid] == target) {
10
+ return mid;
11
+ }
12
13
+ if (nums[low] <= nums[mid]) {
14
+ if (nums[low] <= target && target < nums[mid]) {
15
+ high = mid - 1;
16
+ } else {
17
+ low = mid + 1;
18
19
20
+ if (nums[mid] < target && target <= nums[high]) {
21
22
23
24
25
26
27
28
+ return -1;
29
30
+};
0 commit comments