diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/two_sum.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/two_sum.cpp')
-rw-r--r-- | other/two_sum.cpp | 35 |
1 files changed, 0 insertions, 35 deletions
diff --git a/other/two_sum.cpp b/other/two_sum.cpp deleted file mode 100644 index e75565d..0000000 --- a/other/two_sum.cpp +++ /dev/null @@ -1,35 +0,0 @@ -// 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"); -} |