diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/two_sum.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/two_sum.cpp')
-rw-r--r-- | other/two_sum.cpp | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/other/two_sum.cpp b/other/two_sum.cpp new file mode 100644 index 0000000..e75565d --- /dev/null +++ b/other/two_sum.cpp @@ -0,0 +1,35 @@ +// 1. Two Sum +#include "leetcode.h" + +class Solution { +public: + vector<int> twoSum(vector<int> &nums, int target) { + vector<int> ans; + unordered_map<int, int> um; + int n = nums.size(); + for (int i = 0; i < n; i++) { + int search_num = target - nums[i]; + if (um.find(search_num) != um.end()) { + ans.push_back(um[search_num]); + ans.push_back(i); + break; + } + um[nums[i]] = i; + } + return ans; + } +}; + +int main() { + Solution obj; + vector<int> n1 = {2, 7, 11, 15}, n2 = {3, 2, 4}, n3 = {3, 3}; + for (auto i : obj.twoSum(n1, 9)) + printf("%d ", i); + printf("\n"); + for (auto i : obj.twoSum(n2, 6)) + printf("%d ", i); + printf("\n"); + for (auto i : obj.twoSum(n3, 6)) + printf("%d ", i); + printf("\n"); +} |