leetcode |面试题 10.03. 搜索旋转数组

class Solution {
public:
    int search(vector<int>& arr, int target) {
        if(find(arr.begin(), arr.end(), target) != arr.end())
        {
            return distance(arr.begin(), find(arr.begin(), arr.end(), target));
        }
        return -1;
    }
};