- class Solution {
- private:
- map<int, int > m;
- vector<int> a;
- public:
- vector<int> twoSum(vector<int> &nums, int target) {
- for (int i = 0; i < nums.size(); ++i) {
- m[nums[i]] = i;
- }
- for (int i = 0; i < nums.size(); ++i) {
- if (m[target - nums[i]] && (i != m[target - nums[i]])) {
- a.push_back(i);
- a.push_back(m[target - nums[i]]);
- break;
- }
- }
- return a;
- }
- };
复制代码 |