代码:
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
vector<int> res;
for(int i=0;i<numbers.size()-1;i++){
int j=i+1;
while(j<numbers.size() && numbers[j]<=target-numbers[i]){
if( j+1<numbers.size() && numbers[i]==numbers[j]
&& numbers[j]==numbers[j+1]) {避免超时用例
i=j;
break;
}
else if(numbers[j]==target-numbers[i]){//满足
res.push_back(i+1);
res.push_back(j+1);
return res;
}
j++;
}
}
return res;
}
};