LeetCode第1题

vector<int> twoSum(vector<int>& nums, int target) {
vector<int>b = nums;
sort(nums.begin(), nums.end());
int i = 0, j = nums.size() - 1;
while (1){
if (nums[i] + nums[j] < target)
i++;
else if (nums[i] + nums[j] > target)
j--;
else{
i = nums[i];
j = nums[j];
break;
}
}
struct value{
int a;
bool b;
value(int i, bool s){
a = i;
b = s;
}
};
vector<value>c;
c.push_back(value(i,0));
c.push_back(value(j,0));
vector<int>d;
for (int i = 0; i < b.size(); i++){
if (c[0].b == 0 && c[0].a == b[i]){
d.push_back(i);
c[0].b = 1;
}
else if (c[1].b == 0 && c[1].a == b[i]){
d.push_back(i);
c[1].b = 1;
}
}
return d;
}