LeetCode 1 — 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

翻译
给定一个整数数组和一个目标值，找出数组中和为目标值的两个数。
你可以假设每个输入只对应一种答案，且同样的元素不能被重复利用。

给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

分析
复制一份数组进行排序，左右遍历找到两个数，再和原数组对比找到下标。

c++实现

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> num = nums;
        sort(num.begin(),num.end());
        int p = 0;
        int q = num.size()-1;
        while (num[p] + num[q] != target)
        {
            if (num[p] + num[q] > target)
                q--;
            else
                p++;
        }
        vector<int> twoNums;
        for (int i = 0; i <= nums.size()-1; i++)
        {
            if (twoNums.size() < 2)
            {
                if (nums[i] == num[p])
                {
                    twoNums.push_back(i);
                    continue;
                }
                if (nums[i] == num[q])
                {
                    twoNums.push_back(i);
                    continue;
                }
            }
        }
        return twoNums;
    }
};