题解 | #在旋转过的有序数组中寻找目标值#
在旋转过的有序数组中寻找目标值
https://www.nowcoder.com/practice/87c0e7abcbda41e7963660fa7d020995
class Solution { public: int search(vector<int>& nums, int target) { for(int i=0;i<nums.size();i++){ if(nums[i]==target) return i; } return -1; } };