leetcode33. 搜索旋转排序数组

题目：33. 搜索旋转排序数组

class Solution {
public:
    int search(vector<int>& nums, int target) {
        unordered_map<int,int> mp;
        for(int i=0; i<nums.size(); i++)
            mp[nums[i]] = i;
        if(mp.count(target) != 0) return mp[target];
        else return -1;
    }
};