LeetCode:two sum

#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;

struct Node
{
    int num;
    int index;
};

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

        for(int i=0;i!=numbers.size();++i)
        {
            Node node;
            node.num=numbers[i];
            node.index=i+1;
            data.push_back(node);
        }

        sort(data.begin(),data.end(),[](const Node &a,const Node &b){return a.num<=b.num;});

        int i=0,j=numbers.size()-1;

        while(i!=j)
        {
            int sum=data[i].num+data[j].num;

            if(sum<target)
            {
                ++i;
            }
            else if(sum>target)
            {
                --j;
            }
            else
            {
                break;
            }
        }

        if(data[i].index>data[j].index){
            result.push_back(data[j].index);
            result.push_back(data[i].index);
        }
        else
        {
            result.push_back(data[i].index);
            result.push_back(data[j].index);
        }

        return result;
    }
};