【LeetCode 1_數組_哈希表】Two Sum

解法一：O(N) 1 vector<int> twoSum(vector<int>& nums, int target) 2 { 3 unordered_map<int, int> numsHash; 4 vector<int> res; 5 6 for (int i = 0; i < nums.size(); ++i) { 7 int nu

>>阅读原文<<