[LeetCode]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

解题方案：

定义一个结构体，用来存储原数组中的值和位置，然后对原数组按值进行排序，得到新数组。对新数组按首尾向中间遍历。下面是该题的代码：

struct number_and_location{
    int number;
    int location;
    bool operator < (const number_and_location& lhs)const {
        return number < lhs.number;
    }
};

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        int len_of_numbers = numbers.size();
        vector<int> index_of_result(2, 0);
        vector<number_and_location> change_of_source;
        for(int i = 0; i < len_of_numbers; ++i){
            change_of_source.push_back((number_and_location){numbers[i],i});
        }
        sort(change_of_source.begin(),change_of_source.end());
        int j = len_of_numbers - 1;
        int i = 0;
        while ( j != i){
            if(change_of_source[i].number + change_of_source[j].number == target){
                if(change_of_source[i].location < change_of_source[j].location){
                    index_of_result[0] = change_of_source[i].location + 1;
                    index_of_result[1] = change_of_source[j].location + 1;
                }else {
                    index_of_result[0] = change_of_source[j].location + 1;
                    index_of_result[1] = change_of_source[i].location + 1;
                }
                break;
            }else if(change_of_source[i].number + change_of_source[j].number < target){
                ++i;
            }else {
                --j;
            }
        }
        return index_of_result;
    }
};

 修改2015-10-02

用哈希表

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> index;
        vector<int> result;
        for (size_t i = 0; i < nums.size(); ++i) {
            if (index.find(target - nums[i]) == index.end()) {
                index[nums[i]] = i;
            } else {
                result.push_back(index[target - nums[i]] + 1);
                result.push_back(i + 1);
                
                return result;
            }
        }
    }
};