LeetCode: Two Sum Analysis

LeetCode: Two Sum Analysis

 

Two Sum Total Accepted: 199288 Total Submissions: 913621 Difficulty: Easy

 

Given an array of integers, returnindicesof the two numbers such that they add up to a specific target.

You may assume that each input wowould haveexactlyone 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 tozero-basedindices. Please read the above updated description carefully.

 

Hide TagsArrayHash TableHide Similar Problems (M) 3Sum (M) 4Sum (M) Two Sum II-Input array is sorted (E) Two Sum III-Data structure design

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Code:

 

 

class Solution {public:    vector
 
   twoSum(vector
  
   & nums, int target) {        map
   
     m;        vector
    
      ret;        for(int i=0;i
     
      i){                ret.push_back(i);                ret.push_back(m[tmp]);                break;            }        }        return ret;    }};