导读:
简单的题目,只说明题意,或者直接说明结论
下面的难题,会做详细的解释和证明
1 ~ 9
两重for循环,暴力枚举
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int i = 0, j = 0;
for (; i < nums.size(); i ++ )
for (j = 0; j < i; j ++ )
if (nums[i] + nums[j] == target) return {i, j};
return {i, j};
}
};