Leetcode-Two Sum
2014-11-28 02:02
253 查看
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
Have you met this question in a real interview?
Analysis:
Be carefull: the return indexs are not zero-based! Means that the position 0 should return 1.
Solution:
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
Have you met this question in a real interview?
Analysis:
Be carefull: the return indexs are not zero-based! Means that the position 0 should return 1.
Solution:
public class Solution { public int[] twoSum(int[] numbers, int target) { int[] res = new int[2]; Map<Integer,Integer> map = new HashMap<Integer,Integer>(); for (int i=0;i<numbers.length;i++) if (map.containsKey(target-numbers[i])){ res[0] = map.get(target-numbers[i]); res[1] = i+1; break; } else { map.put(numbers[i],i+1); } return res; } }
相关文章推荐
- Two Sum--LeetCode
- LeetCode 1.Two Sum
- LeetCode - Two Sum 完整代码(GO)
- 【leetcode】 1. Two Sum
- 【LeetCode】1:Two Sum
- leetcode-1.Two Sum
- [C++]LeetCode: 14 Two Sum
- [leetcode]Two Sum
- leetcode------第一题 Two Sum
- LeetCode 1 Two Sum
- leetcode [001] : Two Sum
- LeetCode:Two Sum
- LeetCode 1.Two Sum
- 001 Two Sum [Leetcode]
- LeetCode (1) Two Sum
- 【leetcode】Two Sum
- LeetCode_Two Sum
- LeetCode:Two Sum
- leetcode(1)_Two Sum
- LeetCode--Two Sum