[leetcode-1] Two Sum
哈希表法：【C++实现】class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> has; for(int i = 0; i < nums.size(); ++i){ if(has.find(target - nums[i]) != has.en.
原创
2020-09-22 08:55:17 ·
311 阅读 ·
1 评论
关注
分享
扫一扫