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.

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;
        std::unordered_map<int, int> diff_map;
        int index = 0;
        for(auto it = nums.begin(); it != nums.end(); it++)
        {
            diff_map.insert(std::make_pair(*it, index++));
        }
        index = 0;
        std::set<int> result_index_set;
        for(auto it = nums.begin(); it != nums.end(); it++, index++)
        {
            if(diff_map.count(target - *it) > 0 && diff_map[target - *it] != index)
            {
                if(result_index_set.count(index) == 0)
                {
                    result.push_back(index);
                    result.push_back(diff_map[target - *it]);
                    result_index_set.insert(index);
                    result_index_set.insert(diff_map[target - *it]);
                }
            }
        }
        return result;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值