[LeetCode] Search in Rotated Sorted Array

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
int search(vector<int>& nums, int target) {
bool left;
if(target>nums[nums.size()-1]){
left = true;
}else{
left = false;
}
return binary_search(nums, 0, nums.size()-1, left, target);
}

int binary_search(vector<int>& nums,int start_pos,int end_pos,bool left,int target){
if(start_pos<0||end_pos<0||start_pos>end_pos){
return -1;
}
if(start_pos == end_pos){
if(nums[start_pos] == target)
return start_pos;
else
return -1;
}
int medium = (start_pos+end_pos)/2;
bool mid_left = nums[medium]>nums[nums.size()-1];
if(nums[medium]>target){
if(mid_left == left){
return binary_search(nums, start_pos, medium-1, left, target);
}else{
return binary_search(nums, medium+1, end_pos, left, target);
}
}else if(nums[medium]<target){
if(mid_left == left){
return binary_search(nums, medium+1, end_pos, left, target);
}else{
return binary_search(nums, start_pos, medium-1, left, target);
}
}else{
return medium;
}
}
};

int main(){
vector<int> vec;
vec.push_back(1);
vec.push_back(3);
Solution s;
int result = s.search(vec, 0);
cout<<result<<endl;
}