Two sum

题意:
Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
代码:

class Solution {
private:
    map<int,int> mp;
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        // 注意return的序号从1开始
        // 想法比较巧妙:主要思想映射
        int index1=-1,index2=-1;
        for(int i=0;i<nums.size();++i){
            if(mp.find(nums[i])==mp.end()){
                mp.insert(make_pair(target-nums[i],nums[i]));
            }
            else{
                if(mp.find(nums[i])->second==target-nums[i]){
                     index2=i;
                     break;
                }
                else mp.insert(make_pair(target-nums[i],nums[i]));
            }
        }
        for(int i=0;i<nums.size();++i){
            if(nums[index2]+nums[i]==target){
                index1=i;
                break;
             }
        }
        return {index1+1,index2+1};
    }
};
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/shiyang6017/article/details/49890205
个人分类: 算法 映射
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Two sum

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭