class Solution { public: int search(vector<int>& nums, int target) { int i; for(i=0;i<nums.size();i++) { if(nums[i]==target) { return i; } } return -1; } };
LeetCode 33. Search in Rotated Sorted Array
最新推荐文章于 2023-12-29 18:00:11 发布
class Solution { public: int search(vector<int>& nums, int target) { int i; for(i=0;i<nums.size();i++) { if(nums[i]==target) { return i; } } return -1; } };