iframe-proxy | Sunbelt Computer Software

60 lines (53 loc) · 827 Bytes

 * Search in rotate array.
 * Binary search.
 * cpselvis (cpselvis@gmail.com)
#include<iostream>
#include<vector>
using namespace std;
class Solution {
  int search(vector<int>& nums, int target) {
    int l = 0, r = nums.size() - 1;
    while (l <= r)
      int m = (l + r) >> 1;
      if (nums[m] == target)
      if (nums[l] <= nums[m])
	if (target >= nums[l] && target < nums[m])
	  r = m - 1;
	  l = m + 1;
	if (target > nums[m] && target <= nums[r])
	  l = m + 1;  
	  r = m - 1;
    return -1;
int main(int argc, char **argv)
  Solution s;
  int arr[7] = {0, 1, 2, 4, 5, 6, 7};
  vector<int> vec(arr + 0, arr + 7);
  cout << s.search(vec, 4) << endl;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

solution033.cpp

Latest commit

History

solution033.cpp

File metadata and controls