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

//1:构建一个节点，节点中保存数组中的数字和数组的下标；2: 排序数组，3: 设置两个指针分别从前和后扫描数组，当两个指针所指向的节点的val和等于target的时候，这两个节点为所要求的节点，保存节点的下标（注意大小顺序）

class Node
{
public:
    int val;
    int index;
    Node(int x, int y):
    val(x),
    index(y)
    {
    }
};

bool comp(const Node& temp1, const Node& temp2)
{
    return temp1.val <= temp2.val;
}

class Solution
{
public:
    vector<int> twoSum(vector<int> &numbers, int target);
};

vector<int> Solution::twoSum(vector<int> &numbers, int target)
{
    vector<int> result;
    
    unsigned long  size = numbers.size();
    
    if(size <= 1)
        return result;
    
    vector<Node> tempNumbers;
    for(int i = 0; i < size ; i++)
    {
        Node tempNode(numbers[i], i+1);
        tempNumbers.push_back(tempNode);
    }
    
    sort(numbers.begin(), numbers.end(), comp);
    
    int start = 0;
    int end = (int)tempNumbers.size() - 1;
    
    while(start < end)
    {
        if(tempNumbers[start].val + tempNumbers[end].val == target)
        {
            if(tempNumbers[start].index < tempNumbers[end].index)
            {
                result.push_back(tempNumbers[start].index);
                result.push_back(tempNumbers[end].index);
            }
            else
            {
                result.push_back(tempNumbers[end].index);
                result.push_back(tempNumbers[start].index);
            }
            
            break;
        }
        else if(tempNumbers[start].val + tempNumbers[end].val < target)
        {
            start++;
        }
        else
        {
            end--;
        }
    }
    
    return result;
}