cpp-algo-cases/chapter_searching/two_sum.cpp

55 lines
1.3 KiB
C++
Raw Normal View History

2024-02-20 16:13:23 +08:00
/**
* File: two_sum.cpp
* Created Time: 2022-11-25
* Author: krahets (krahets@163.com)
*/
#include "../utils/common.hpp"
/* <20><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ö<EFBFBD><C3B6> */
vector<int> twoSumBruteForce(vector<int> &nums, int target) {
int size = nums.size();
// <20><><EFBFBD><EFBFBD>ѭ<EFBFBD><D1AD><EFBFBD><EFBFBD>ʱ<EFBFBD><EFBFBD>Ӷ<EFBFBD>Ϊ O(n^2)
for (int i = 0; i < size - 1; i++) {
for (int j = i + 1; j < size; j++) {
if (nums[i] + nums[j] == target)
return {i, j};
}
}
return {};
}
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϣ<EFBFBD><CFA3> */
vector<int> twoSumHashTable(vector<int> &nums, int target) {
int size = nums.size();
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϣ<EFBFBD><CFA3><EFBFBD><EFBFBD><EFBFBD>ռ<D5BC>Ӷ<EFBFBD>Ϊ O(n)
unordered_map<int, int> dic;
// <20><><EFBFBD><EFBFBD>ѭ<EFBFBD><D1AD><EFBFBD><EFBFBD>ʱ<EFBFBD><EFBFBD>Ӷ<EFBFBD>Ϊ O(n)
for (int i = 0; i < size; i++) {
if (dic.find(target - nums[i]) != dic.end()) {
return {dic[target - nums[i]], i};
}
dic.emplace(nums[i], i);
}
return {};
}
/* Driver Code */
int main() {
// ======= Test Case =======
vector<int> nums = {2, 7, 11, 15};
int target = 13;
// ====== Driver Code ======
// <20><><EFBFBD><EFBFBD>һ
vector<int> res = twoSumBruteForce(nums, target);
cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ res = ";
printVector(res);
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
res = twoSumHashTable(nums, target);
cout << "<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> res = ";
printVector(res);
return 0;
}