LeetCode - Two Sum

Question

Link : https://leetcode.com/problems/two-sum/
Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

Code

一个比较挫的版本：（C++ : 560 ms）

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;
        for(int i = 0; i < nums.size(); i++){
            for(int j = nums.size() - 1; j > i; j--){
                if(nums[i] + nums[j] == target){
                    result.push_back(i);
                    result.push_back(j);
                    return result;
                }
            }
        }
        return result;
    }
};

一个高级的版本：（C++ : 20ms）

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;
        map<int, int> indexs; // key = nums[index]; value = index;
        map<int, int>::iterator it;
        for(int i = 0; i < nums.size(); i++){
            it = indexs.find(target - nums[i]);
            if(it != indexs.end()){
                result.push_back(it->second);
                result.push_back(i);
                return result;
            }
            indexs.insert(pair<int, int>(nums[i], i));
        }
        return result;
    }
};