【Leetcode】Two Sum
2014-05-05 09:03
274 查看
[Question]
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
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int len=numbers.length;
assert(len>=2);
int[] result=new int[2];
HashMap<Integer,Integer> map=new HashMap<Integer,Integer>();
for(int i=0;i<len;i++){
if(!map.containsKey(numbers[i])){
map.put(target-numbers[i],i);
}
else{
int index=map.get(numbers[i]);
result[0]=index+1;
result[1]=i+1;
break;
}
}
return result;
}
}
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
public class Solution {
public int[] twoSum(int[] numbers, int target) {
int len=numbers.length;
assert(len>=2);
int[] result=new int[2];
HashMap<Integer,Integer> map=new HashMap<Integer,Integer>();
for(int i=0;i<len;i++){
if(!map.containsKey(numbers[i])){
map.put(target-numbers[i],i);
}
else{
int index=map.get(numbers[i]);
result[0]=index+1;
result[1]=i+1;
break;
}
}
return result;
}
}
相关文章推荐
- leetcode 1. Two Sum
- LeetCode-Two Sum-找和等于某个数的两个数-二分查找
- 刷leetcode:Two Sum
- [LeetCode]1. Two Sum
- 第一个leetcode题目: two sum
- Two Sum —— Leetcode
- 【leetcode】1.Two Sum
- 1 leetcode-Two Sum
- LeetCode 001 :Two Sum
- LeetCode解题-#1-Two sum
- LeetCode-Two sum
- leetcode-1 Two Sum
- LeetCode Two Sum
- 【leetcode】Two Sum
- leetcode(1)_two sum
- 【JAVA、C++】LeetCode 001 Two Sum
- LeetCode1-Two Sum
- Leetcode 1 Two Sum 两数之和
- LeetCode_Two Sum
- LeetCode-1 Two Sum