[leetcode]Two Sum
来源:互联网 发布:数据库中储存的是什么 编辑:程序博客网 时间:2024/06/15 17:11
[leetcode]Two Sum
题目
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
思路:
先将vector排序,然后分别从头尾元素开始,不停向中间逼近,直到有两个值相加等于target为止。
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> result; if (nums.size() < 2) return result; vector<int> temp(nums); sort(nums.begin(), nums.end()); auto index1 = 0; auto index2 = nums.size()-1; while (index1 < index2) { if (nums[index1] + nums[index2]>target) { --index2; } else if (nums[index1] + nums[index2] < target) { ++index1; } else { for (auto i = 0; i < temp.size(); i++) { if (nums[index1] == temp[i]) { result.push_back(i + 1); break; } } for (auto i = temp.size() - 1; i >= 0; i--) { if (nums[index2] == temp[i]) { result.push_back(i + 1); break; } } break; } } if (result[0] > result[1]) swap(result[0],result[1]); return result; }};
不足:用了一个跟nums一模一样的辅助数组来记录元素的原始位置。
另一种解法
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> m; for(int i = 0; i < nums.size(); i++) { if(m.find(target-nums[i]) != m.end()) return {m[target-nums[i]], i}; m[nums[i]] = i; } }};
不过map里会产生一些无用的数据。
0 0
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- leetcode之Two Sum
- LeetCode | Two Sum
- 下拉刷新控件
- Python-OpenCV(3)
- 括号匹配判断
- 关于数的溢出
- Android学习之两款下拉刷新库分享
- [leetcode]Two Sum
- lintcode: Implement Queue by Two Stacks
- Android 自定义View
- android接入即时IM
- 编程技巧
- jvm系列堆和栈的区别(一)
- Grpc 在Android中的配置
- Ubuntu vpn pptp客户端搭建过程中错误解决
- iOS学习之路(二)--基础篇