暴力求解方法
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
vector<int> res;
int len = numbers.size();
for (int i = 0; i < len-1; i++) {
for(int j = i+1;j<len;j++){
if(i>0&&numbers[i]==numbers[i-1]) continue;
if(numbers[i]+numbers[j]>target) continue;
if(numbers[i]+numbers[j]<target) continue;
if(numbers[i]+numbers[j]==target) return {i+1,j+1};
}
}
return {-1,-1};
}
};