leetcode TwoSum
2015-03-04 17:18
288 查看
题目如下:
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
解题思路:
利用HashTable判断重复,循环时可以将题意转为求总和与这个值的差值是否在数组中,由于HashTable查找一个数的时间为是常数,所以总的时间复杂度为O(N)
代码:
public int[] twoSum(int[] numbers, int target) {
int index[] = new int[2];
Hashtable<Integer, Integer> nums = new Hashtable<Integer, Integer>();
for (int i = 0; i < numbers.length; i++) {
Integer n = nums.get(numbers[i]);
if (n == null)
nums.put(numbers[i], i);
n = nums.get(target - numbers[i]);
if (n != null && n < i) {//n<i的目的是自己不能加自己
index[0] = n + 1;
index[1] = i + 1;
return index;
}
}
return index;
}
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
解题思路:
利用HashTable判断重复,循环时可以将题意转为求总和与这个值的差值是否在数组中,由于HashTable查找一个数的时间为是常数,所以总的时间复杂度为O(N)
代码:
public int[] twoSum(int[] numbers, int target) {
int index[] = new int[2];
Hashtable<Integer, Integer> nums = new Hashtable<Integer, Integer>();
for (int i = 0; i < numbers.length; i++) {
Integer n = nums.get(numbers[i]);
if (n == null)
nums.put(numbers[i], i);
n = nums.get(target - numbers[i]);
if (n != null && n < i) {//n<i的目的是自己不能加自己
index[0] = n + 1;
index[1] = i + 1;
return index;
}
}
return index;
}
相关文章推荐
- leetcode中第一题twosum问题解答算法的可行性证明
- leetcode之TwoSum[Java]
- LeetCode: Two Sum (Java)
- leetcode 167: Two Sum II - Input array is sorted
- LeetCode(Two Sum)
- LeetCode 编程练习 - Two Sum II - Input array is sorted学习心得
- LeetCode - 371 - Sum of Two Integers
- leetcode——Two Sum II - Input array is sorted
- 【LeetCode-面试算法经典-Java实现】【001-Two Sum(求两个数的和)】
- Leetcode Two Sum
- leetcode -- Two Sum II - Input array is sorted
- LeetCode: 1. Two Sum python
- Leetcode Two Sum II – Input array is sorted (Java)
- [Leetcode] 1.Two Sum(unordered_map)
- leetcode[Minimum Index Sum of Two Lists]//待整理多种解法
- 【Leetcode】Two Sum II #Too easy, just review hashmap
- Leetcode 1. Two Sum(python)
- [LeetCode] Two Sum III - Data structure design 两数之和之三 - 数据结构设计
- LeetCode--two-sum
- Two Sum_leetcode_#1