[LeetCode] Two Sum

struct Wrapper {
int val;
int pos;
};

bool compare(const Wrapper &w1, const Wrapper &w2) {
return w1.val < w2.val;
}

class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<Wrapper> v;

for (int i = 0; i < numbers.size(); i++) {
Wrapper w;
w.val = numbers[i];
w.pos = i + 1;
v.push_back(w);
}

sort(v.begin(), v.end(), compare);

vector<int> ret;

int l = 0;
int r = v.size() - 1;

while (l <= r) {
int sum = v[l].val + v[r].val;

if (sum == target) {
int m = max(v[l].pos, v[r].pos);
int n = min(v[l].pos, v[r].pos);
ret.push_back(n);
ret.push_back(m);

return ret;
} else if (sum < target) {
l++;
} else {
r--;
}
}

return ret;
}
};