LeetCode0523

http://leetcode.com/onlinejudge#question_1

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        vector<int> result;
        map<int, int> mymap;
        
        typedef vector<int>::iterator iter_type;
        typedef map<int, int>::iterator map_iter_type;

        map_iter_type map_iter;
        for(iter_type it = numbers.begin(); it != numbers.end(); ++it) {
            map_iter = mymap.find(target - *it);
            if (mymap.end() != map_iter) {
                result.push_back(map_iter->second);
                result.push_back(it-numbers.begin()+1);
                return result;
            }
            mymap[*it] = it-numbers.begin()+1;
        }
        
        /*
        vector<int> result;
        typedef vector<int>::iterator iter_type;
        for(iter_type it1 = numbers.begin(); it1 != numbers.end(); ++it1) {
            for(iter_type it2 = it1+1; it2 != numbers.end(); ++it2) {
                if(target == *it1 + *it2) {
                    result.push_back(it1-numbers.begin()+1);
                    result.push_back(it2-numbers.begin()+1);
                    break;
                }
            }        
        }
        
        return result;
        */
    }
};