Leetcode——1. Two Sum

2019独角兽企业重金招聘Python工程师标准>>>

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.

import java.util.Hashtable;
public class Solution {public int[] twoSum(int[] nums, int target) {int index[]=new int[2];Hashtable<Integer, Integer> hashTable = new Hashtable<Integer, Integer>();for(int item=0;item<nums.length;item++){if(hashTable.get(nums[item])==null&&hashTable.get(target-nums[item])==null){hashTable.put(nums[item], item);}else if(hashTable.get(target-nums[item])!=null){index[1] = item;index[0] = hashTable.get(target-nums[item]);break;}}return index;}
}

转载于:https://my.oschina.net/wtzheng/blog/646738

Leetcode——1. Two Sum相关推荐

leetcode 304. Range Sum Query 2D - Immutable |304. 二维区域和检索 - 矩阵不可变（二维前缀和问题）
题目 https://leetcode.com/problems/range-sum-query-2d-immutable/ 题解本题是 medium 难度,二维前缀和问题.相似题目有: Easy: ...
【动态规划】LeetCode 377. Combination Sum IV
LeetCode 377. Combination Sum IV Solution1: 我的未能AC的答案题目描述的和前几道题差不多,但实际上不能用DFS来做(会超时),要用动态规划,还是记录一下吧 ...
【DFS】LeetCode 39. Combination Sum
LeetCode 39. Combination Sum Solution1: DFS,这个套路要熟记啊! class Solution { public:vector<vector<in ...
LeetCode 167.Two Sum II 解题报告
LeetCode 167.Two Sum II 解题报告题目描述 Given an array of integers that is already sorted in ascending ord ...
leetcode 1005 Maximize Sum Of Array After K Negations
leetcode 1005 Maximize Sum Of Array After K Negations 1.题目描述 2.解题思路 3.Python代码 1.题目描述给定一个整数数组 A,我们只 ...
[勇者闯LeetCode] 1. Two Sum
[勇者闯LeetCode] 1. Two Sum Description Given an array of integers, return indices of the two numbers s ...
[勇者闯LeetCode] 112. Path Sum
[勇者闯LeetCode] 112. Path Sum Description Given a binary tree and a sum, determine if the tree has a r ...
数据结构线段树介绍与笔试算法题-LeetCode 307. Range Sum Query - Mutable--Java解法
此文首发于我的个人博客:zhang0peter的个人博客 LeetCode题解文章分类:LeetCode题解文章集合 LeetCode 所有题目总结:LeetCode 所有题目总结线段树(Segme ...
LeetCode 653. Two Sum IV - Input is a BST--Python解法
题目地址:Two Sum IV - Input is a BST - LeetCode Given a Binary Search Tree and a target number, return t ...
LeetCode 167. Two Sum II - Input array is sorted--Python解法
题目地址:Two Sum II - Input array is sorted - LeetCode Given an array of integers that is already sorted ...

Leetcode——1. Two Sum

Leetcode——1. Two Sum相关推荐

最新文章

热门文章