LeetCode--Two Sum

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_36124194/article/details/82527482

#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.

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

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



class Solution {
    vector<int> twoSum(vector<int> &numbers, int target)
	    //Key is the number and value is its index in the vector.
		unordered_map<int, int> hash;
		vector<int> result;
		for (int i = 0; i < numbers.size(); i++) {
			int numberToFind = target - numbers[i];

            //if numberToFind is found in map, return them
			if (hash.find(numberToFind) != hash.end()) {
                    //+1 because indices are NOT zero based
				return result;

            //number was not found. Put it in the map.
			hash[numbers[i]] = i;
		return result;