关闭

leetcode1

64人阅读 评论(0) 收藏 举报
分类:

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.


代码:

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> ret(2,-1);
        unordered_map<int, int> m;    //value->index map
        for(int i = 0; i < nums.size(); i ++)
        {
            if(m.find(target-nums[i])== m.end())  //target-numbers[i] appeared 
                m[nums[i]]=i;
            else
           {
                ret[0] = m[target-nums[i]]; 
                ret[1] = i;
            }
        }
    return ret;
    }
    
};










0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:2257次
    • 积分:146
    • 等级:
    • 排名:千里之外
    • 原创:12篇
    • 转载:7篇
    • 译文:0篇
    • 评论:0条
    文章分类