版权声明:本文为博主原创文章,未经博主允许可以转载。(转呀转呀/笑哭),希望标注出处hhh https://blog.csdn.net/qq_36428171/article/details/88584950
C++语言:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> twoSum;
int lenNums = nums.size();
for(int i = 0;i < lenNums; i++){
for(int j = i + 1; j<lenNums; j++){
if((nums[i] + nums[j]) == target){
twoSum.push_back(i);
twoSum.push_back(j);
}
}
}
return twoSum;
}
};
时间复杂度O(n*n)