直接枚举,复杂度O(n^2).
class Solution {
public:
vector<int> twoSum(vector<int> &nums, int target) {
vector<int> ans;
for (int i = 0; i < nums.size(); ++i) {
for (int j = i + 1; j < nums.size(); ++j) {
if (target == nums[i] + nums[j]) {
ans.push_back(nums[i]);
ans.push_back(nums[j]);
return ans;
}
}
}
}
};