【leetcode刷题笔记】Two Sum
2014-07-21 19:42
381 查看
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
利用一个hashmap,把数组中的元素和它们的索引+1作为键-值对,然后对于每个元素numbers[i]寻找target-numbers[i],如果找到了就把i+1和map.get(target-numbers[i])返回。
代码如下:
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
利用一个hashmap,把数组中的元素和它们的索引+1作为键-值对,然后对于每个元素numbers[i]寻找target-numbers[i],如果找到了就把i+1和map.get(target-numbers[i])返回。
代码如下:
public class Solution { public int[] twoSum(int[] numbers, int target) { int[] answer = new int[2]; if(numbers == null || numbers.length == 0) return answer; HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); for(int i = 0;i < numbers.length;i++) map.put(numbers[i], i+1); for(int i = 0;i < numbers.length;i++){ if(map.containsKey(target-numbers[i])){ if(i+1 == map.get(target-numbers[i])) continue; answer[0] = i+1; answer[1] = map.get(target-numbers[i]); break; } } return answer; } }
相关文章推荐
- leetcode刷题笔记-two sum
- LeetCode笔记:1. Two Sum
- jiler的LeetCode学习笔记 java版本Two Sum
- LeetCode笔记1--Two Sum
- LeetCode解题笔记1 Two Sum
- (python)leetcode刷题笔记 01 TWO SUM
- LeetCode刷题笔记 01 Two Sum
- LeetCode小白菜笔记[1]:Two Sum
- LeetCode笔记-A1-Two Sum
- LeetCode 学习笔记:Question 1、Two Sum
- leetcode 1 two sum 刷题学习笔记
- LeetCode习题笔记——Two Sum
- LeetCode 一 two Sum 笔记
- LeetCode 笔记系列三 3Sum
- LeetCode: Two Sum
- LeetCode题目笔记(二) -- Maximum Depth of Binary Tree
- LeetCode 笔记系列一 Median of Two Sorted Arrays
- LeetCode 笔记系列五 Generate Parentheses
- [LeetCode] Two Sum, Solution
- LeetCode 笔记系列二 Container With Most Water