[LeetCode] Two Sum

Very simple. Note the index starts from 1.

class Solution {public:    vector<int> twoSum(vector<int> &numbers, int target) {        vector<int> result;        vector<int> num(numbers);        int a,b;        if(num.size()<2) return result;        sort(num.begin(),num.end());        int i=0,j=num.size()-1;        while(i<j) {            if(num[i]+num[j]==target) {                a=num[i];                b=num[j];                break;            }            if(num[i]+num[j]>target)                j--;            else i++;        }        for(int i=0;i<num.size();i++)            if(numbers[i]==a || numbers[i]==b)                result.push_back(i+1);        return result;    }};