【Leetcode】Array | 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].

 

---

解题思路：

1. 暴力枚举，复杂度O(n^2)
2. 先排序，再用二分法查找，但是在排序的过程中需要记录原先字母的顺序。O(nlogn)
3. hash，复杂度，其实也是O(n^2)，在find里面的复杂度为O(n)

1.枚举

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

2.哈希

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int,int> mapping;
        vector<int> result;
        for(int i = 0;i < nums.size();i++){
            mapping[nums[i]] = i;
        }
        for(int i = 0;i < nums.size();i++){
            const int gap = target - nums[i];
            if(mapping.find(gap) != mapping.end() && mapping[gap] > i){
                result.push_back(i);
                result.push_back(mapping[gap]);
                break;
            }
        }
        return result;
    }
};