leetcode第一题,二数之和
来源:互联网 发布:北京婚纱照 知乎 编辑:程序博客网 时间:2024/06/16 02:11
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, and you may not use thesame element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].下面用C++语言编写,大体改写于大神代码,但是他代码有点问题,可能是题目修改了,要求给下角标,我贴出改好的代码class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { //Key is the number and value is its index in the vector.unordered_map<int, int> hash;vector<int> result;for (int i = 0; i < nums.size(); i++) {int numToFind = target - nums[i]; //if numberToFind is found in map, return themif (hash.find(numToFind) != hash.end()) { //+1 because indices are NOT zero basedresult.push_back(hash[numToFind] );result.push_back(i );return result;} //number was not found. Put it in the map.hash[nums[i]] = i;}return result;} };
阅读全文
0 0
- leetcode第一题,二数之和
- <LeetCode> 题56:两数之和
- <LeetCode> 题57:三数之和
- LeetCode | 两数之和
- LeetCode之求组合数之和二CombinationSumII
- LeetCode之两数之和
- 两数之和(二)
- Leetcode 第一题,两数和问题
- LeetCode第一题--两个数的和
- LeetCode Two Sum 两数之和
- LeetCode 1 找出两个数之和
- leetcode之三数之和 II
- LeetCode之求组合数之和CombinationSum
- leetcode 1 Two Sum 两数之和
- Leetcode: 15. 3Sum 三数之和
- Leetcode: 18. 4Sum 四数之和
- leetcode-3sum 三数之和
- [LeetCode] 3Sum 三数之和 Python
- greenDAO对数据库操作的升级问题
- 抽象工厂
- 荷兰计算机科学家Dijkstra
- Weblogic 服务器如何支持https协议
- Java Jedis操作Redis示例(四)——Redis和Mysql的结合方案演进
- leetcode第一题,二数之和
- [NOIP模拟] Math
- bzoj1878 莫队
- 抽象工厂模式一个例子
- java第八天/10.21
- 黄金分割法-C语言
- 决策树之 sklearn 实现
- Linux之GCC经典入门教程
- 支付宝接口接入方法 步骤十分详细