[33] Search in Rotated Sorted Array(TBD)

啊～～寫到生氣啊！！！（鼻孔噴氣）

想說都已經return 了還無窮迴圈是我見鬼了嗎？！

原來是無窮迴圈在後面的測資嗎？！吼～～～～～～～～～！！！

無法惹, 今天到此為止吧Orz

int search(int* nums, int numsSize, int target){

int left = 0, right = numsSize-1;

long int index = -1;

while (left <= right)

{

index = left + (right-left)/2;

if (nums[index] == target)

return index;

if (nums[index]>=nums[left])

{

if ((nums[index] > target) && (nums[left] <= target))

right = index-1;

else

left = index+1;

}

else

{

if( target > nums[index] && target <= nums[right])

left = index+1;

else

right = index-1;

}

}

return -1;

}