Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
#include<algorithm>
struct Numtrc{
public:
int number;
int index;
Numtrc(int _number,int _index)
:number(_number),index(_index){}
};
bool comp(const Numtrc & a,const Numtrc &b)
{
return a.number < b.number;
}
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<Numtrc> num;
vector<int> result;
for(int i = 0;i<nums.size();i++)
{
num.push_back(Numtrc(nums[i],i));
}
sort(num.begin(),num.end(),comp);
int start = 0;
int end = num.size() - 1;
while(start < end)
{
if(num[start].number + num[end].number == target)
{
result.push_back(num[start].index);
result.push_back(num[end].index);
return result;
}
else if(num[start].number + num[end].number < target)
{
start++;
}
else if(num[start].number + num[end].number > target)
{
end--;
}
}
return result;
}
};