Two Sum

标签：style   http   color   os   io   for   re   c   

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

#include "stdafx.h"
#include <string>
#include <iostream>
#include <vector>
#include <map>

using namespace std;

class Solution{
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        map<int, int> mapping;
        vector<int> result;
        for (int i = 0; i < numbers.size(); i++)
        {
            // key: number, value: index
            mapping[numbers[i]] = i;
        }
        for (int i = 0; i < numbers.size(); i++)
        {
            int searched = target - numbers[i];
            // if find the number, store the index value
            if (mapping.find(searched) != mapping.end())
            {
                result.push_back(i + 1);
                result.push_back(mapping[searched] + 1);
                break;
            }
        }
        return result;

    };
};

int _tmain(int argc, _TCHAR* argv[])
{
    Solution *sln = new Solution();
    vector<int> svec;
    svec.push_back(2);
    svec.push_back(7);
    svec.push_back(11);
    svec.push_back(5);

    vector<int> vres = sln->twoSum(svec, 7);    

    return 0;
}

Two Sum,布布扣,bubuko.com

Two Sum

标签：style   http   color   os   io   for   re   c   

原文地址：http://www.cnblogs.com/pengpenghappy/p/3866357.html