1.Two Sum
来源:互联网 发布:白金数据 原著 编辑:程序博客网 时间:2024/05/01 07:15
好久不写代码,今天开始坚持打卡。
//复杂度依然是nlogn, 写oj习惯了本来想自己开节点数组,感觉有点麻烦还要自己写sort()还有find(),应该会比map快点,但是还是用map凑活吧。class Solution {public: vector<int> twoSum(vector<int> &nums, int target) { map<int, int>myMap; vector<int> ans; int len = nums.size(), tmp; for (int i = 0; i < len; ++i) { tmp = target - nums[i]; auto iter = myMap.find(tmp); if (iter != myMap.end() && i != iter->second) { ans.push_back(iter->second); ans.push_back(i); return ans; } myMap[nums[i]] = i; } }};
0 0
- 1. Two Sum && 167. Two Sum II
- LeetCode 1. Two Sum
- [LeetCode]1.Two Sum
- LeetCode 1.Two Sum
- LeetCode --- 1. Two Sum
- 1.Two Sum
- [Leetcode] 1. Two Sum
- leetcode---1.Two sum
- 1.Two Sum
- [Leetcode] 1. Two Sum
- LeetCode 1.Two Sum
- 1. Two Sum
- 1. Two Sum
- 1. Two Sum Ruby
- LeetCode 1.Two Sum
- LeetCode 1.Two Sum
- 1. Two Sum
- 1.Two Sum
- BZOJ 3990 [SDOI2015] 排序
- android cmake 调试
- 专业书37~57
- OpenCV 角点检测(一) Moravec
- Linux 目录结构
- 1.Two Sum
- BZOJ 1861 [Zjoi2006] Book 书架
- Probability
- math.h 三角函数
- 理解java web项目中的路径问题
- 处理:/var/redis/run/redis_6379.pid exists, process is already running or crashed
- POJ1083 Moving Tables
- A1078. 逆序对个数
- Android中BitmapFactory.Options学习