LeetCode Two Sum

原题链接在这里：https://leetcode.com/problems/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].

题解：

采用HashMap记录之前出现的num 和其对应的 index.

Time Complexity: O(n). Space: O(n).

AC Java:

 1 public class Solution {
 2     public int[] twoSum(int[] nums, int target) {
 3         if(nums == null || nums.length < 2){
 4             throw new IllegalArgumentException("Invalid input.");
 5         }
 6
 7         int [] res = {-1, -1};
 8         HashMap<Integer, Integer> hm = new HashMap<Integer, Integer>();
 9         for(int i = 0; i<nums.length; i++){
10             if(!hm.containsKey(target - nums[i])){
11                 hm.put(nums[i], i);
12             }else{
13                 res[0] = hm.get(target-nums[i]);
14                 res[1] = i;
15                 break;
16             }
17         }
18
19         return res;
20     }
21 }

后面跟上Two Sum II - Input array is sorted, Two Sum III - Data structure design, Two Sum IV - Input is a BST, 3Sum, 3Sum Closest, 4Sum.

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/5040710.html

LeetCode Two Sum相关推荐

【同113】LeetCode 129. Sum Root to Leaf Numbers
LeetCode 129. Sum Root to Leaf Numbers Solution1:我的答案二叉树路径和问题,类似113 /*** Definition for a binary tr ...
LeetCode Path Sum III(前缀和)
问题: 给定一个二叉树,它的每个结点都存放着一个整数值. 找出路径和等于给定数值的路径总数. 路径不需要从根节点开始,也不需要在叶子节点结束,但是路径方向必须是向下的(只能从父节点到子节点). 二叉树 ...
LeetCode Combination Sum IV(动态规划)
问题:给出一个数组nums和目标数target,问有多少组合形式思路:用dp(i)表示目标数target的组合数.则有状态转移关系为dp(i)=sum(dp(i-nums[j])),其中i>= ...
LeetCode Range Sum Query - Mutable(树状数组、线段树)
问题:给出一个整数数组,求出数组从索引i到j范围内元素的总和.update(i,val)将下标i的数值更新为val 思路:第一种方式是直接根据定义,计算总和时直接计算从i到j的和第二种方式是使用树状 ...
LeetCode Two Sum III - Data structure design
原题链接在这里:https://leetcode.com/problems/two-sum-iii-data-structure-design/ 题目: Design and implement a ...
LeetCode Subarray Sum Equals K
原题链接在这里:https://leetcode.com/problems/subarray-sum-equals-k/description/ 题目: Given an array of integ ...
leetcode 907. Sum of Subarray Minimums | 907. 子数组的最小值之和（单调栈）
题目 https://leetcode.com/problems/sum-of-subarray-minimums/ 题解单调栈问题.参考左神算法课:https://ke.qq.com/webcou ...
leetcode 371. Sum of Two Integers | 371. 两整数之和（补码运算）
题目 https://leetcode.com/problems/sum-of-two-integers/ 题解根据 related topics 可知,本题考察二进制运算. 第一次提交的时候,没想 ...
[Leetcode]Two sum(两数之和)系列总结
Two sum 题目 Given an array of integers, return indices of the two numbers such that they add up to a ...
leetcode -- 3 sum
3-sum 题目描写叙述: Given an array S of n integers, are there elements a, b, c in S such that a + b + c = ...

LeetCode Two Sum

LeetCode Two Sum相关推荐

最新文章

热门文章