leetcode 1 Two Sum
来源:互联网 发布:windows 10 周年更新 编辑:程序博客网 时间:2024/06/05 14:41
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
#include <iostream>#include <stdio>#include <vector>#include <map>using namespace std;class Solution {public:vector<int> twoSum(vector<int>& nums, int target) {vector<int> ans;map<int, int> num2exit;for(int i = 0; i < nums.length(); i++) {map[nums[i]] = i;}int another = 0, i1 = 0, i2 = 0;for (int i = 0; i < nums.length(); ++i){another = target - nums[i];if(num2exit.count(another)) {i2 = num2exit[another];if(i2 != i1) break;}}ans.push_back(i1+1);ans.push_back(i2+1);return ans;}}
0 0
- LeetCode 1 - Two Sum
- leetcode 1 Two Sum
- Leetcode【1】:Two Sum
- [leetcode 1] Two Sum
- 【leetcode-1】Two Sum
- [leetcode 1] Two Sum
- [Leetcode] 1 - Two Sum
- LeetCode (1) Two Sum
- LeetCode 1:《Two Sum》
- LeetCode | #1 Two Sum
- leetcode-1 Two Sum
- Two Sum | LeetCode(1)
- [Leetcode]1Two Sum
- leetcode 1 Two Sum
- leetcode #1 Two Sum
- leetcode 1:Two Sum
- LeetCode 1 Two Sum
- leetcode #1 two sum
- 蓝桥杯 算法训练 集合运算
- Redhat6.6 图形化安装 oracle12c
- Mina是什么
- 图像编程-彩色图像灰度化
- 【随笔】聊一聊服务器的那些事儿
- leetcode 1 Two Sum
- SVN的Trunk、Branch和Tag(一)
- Android多媒体应用——通知的使用(Notification)
- oc中自定义结构体
- Github上如何取消fork别人的repository
- Essential Notes on Database(III) Normalization 范式 (I)
- Java开发者必备的六款工具
- 数据结构-Java实现-链表回顾
- iOS中对数据的存储的一种方法--归档