LeetCode 1.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, and you may not use the same element twice.

Example:

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

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

解法一：暴力解法

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

这种暴力解法的runtime大概在200ms左右（19cases）

解法二：利用Map

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
           Map<Integer, Integer> mymap = new HashMap<>();
        for (int i = 0 ; i < nums.size() ; i++) {
           int complement = target - nums.at(i);
           if (mymap.containsKey(complement)) {
               vector<int> result;
               result.push_back(i);
               result.push_back(mymap.get(complement));
               return result;
           }
           mymap.put(nums.at(i) , i);
       }
};
};