Two Sum
2013-04-12 21:59
232 查看
没有重复元素的情况下,用map做的
class Solution { public: map<int,int> mp; vector<int> twoSum(vector<int> &numbers, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function mp.clear(); for(int i=0;i<numbers.size();i++) mp[numbers[i]]=i+1; int i,j; for(i=1;i<=numbers.size();i++){ int left=target-numbers[i-1]; if(mp.count(left)!=0){ j=mp[left]; break; } } vector<int> tmp; if(i>j){ int temp=i; i=j; j=temp; } tmp.push_back(i); tmp.push_back(j); return tmp; } };
相关文章推荐
- Leetcode : Two Sum
- [leetcode刷题系列]Two Sum
- 无序数组中找出和为N的两个数 Two Sum
- Two Sum
- Two Sum
- Two Sum (LeetCode)
- leetcode----Two Sum
- LeetCode: Two Sum
- 【leetcode】Two Sum
- LeetCode:Two Sum
- leetcode: Two Sum
- Two Sum
- leetcode 刷题之路 45 Two Sum
- two sum
- Leetcode-Two Sum
- Two Sum
- Two Sum
- [LeetCode] Two Sum 两数之和
- [leetcode 1] Two Sum
- Two Sum