【LeetCode】33. Search in Rotated Sorted Array 解题小结

标签：

题目：

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

读入一个元素就将这个元素插入unordered_map里，然后判断是否在里面。

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

【LeetCode】33. Search in Rotated Sorted Array 解题小结

标签：

原文地址：http://www.cnblogs.com/Doctengineer/p/5812536.html