1. 两数之和
解法一:暴力解法
#include
#include
#include
using namespace std;
vector
int main() {
vector
vector
vector
int target = 9;
p = twoSum(nums, target);
for (it = p.begin(); it != p.end(); it++) {
cout << *it << ' ';
}
}
vector
/*
算法思想:枚举数组中的每一个数nums[i],再找数组中是否有target-nums[i]
*/
vector
int last;
for (int i = 0; i < nums.size(); i++) {
last = target - nums[i];
for (int j = i + 1; j < nums.size(); j++) {
if (nums[j] == last) {
ans.push_back(i);
ans.push_back(j);
return ans;
}
}
}
return {};
}
相关阅读
发表评论