LeetCode -- Two Sum
2015-09-06 15:43
351 查看
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
Analysis:
用暴力求解方法,时间复杂度较高,两次for循环,但方法容易想到。
用HashMap记录遍历过的数字所需要的val,然后返回index即可,时间复杂度小。
Answer:
1. 暴力求解:
2. HashMap巧解。
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
Analysis:
O(n2) runtime, O(1) space – Brute force:
The brute force approach is simple. Loop through each element x and find if there is another value that equals to target – x. As finding another value requires looping through the rest of array, its runtime complexity is O(n2).用暴力求解方法,时间复杂度较高,两次for循环,但方法容易想到。
O(n) runtime, O(n) space – Hash table:
We could reduce the runtime complexity of looking up a value to O(1) using a hash map that maps a value to its index.用HashMap记录遍历过的数字所需要的val,然后返回index即可,时间复杂度小。
Answer:
1. 暴力求解:
public class Solution { public int[] twoSum(int[] nums, int target) { int[] res = new int[2]; for(int i=0; i<nums.length; i++) { for(int j=i+1; j<nums.length; j++) { int sum = nums[i] + nums[j]; if(sum == target) { res[0] = i + 1; res[1] = j + 1; break; } } } return res; } }
2. HashMap巧解。
public class Solution { public int[] twoSum(int[] nums, int target) { int[] res = new int[2]; HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); for(int i=0; i<nums.length; i++) { if(map.containsKey(nums[i])) { res[0] = map.get(nums[i]) + 1; res[1] = i + 1; } else { map.put(target - nums[i], i); } } return res; } }
相关文章推荐
- 【转】经典Java程序源代码(一)
- 日期的工具类
- [剑指offer] 和为s的连续子数组
- oracle创建外部表
- Algorithms—275.H-Index II
- 关于Ubuntu14.04在VMware中分辨率的问题
- 手表定理
- android缓存数据到本地放在哪儿最好?
- javascript 中函数的调用:直接调用函数和new function()区别
- Spring AOP原理浅析及入门实例
- 51nod 1267:4个数和为0 哈希
- poj3616 Milking time
- 给用户主机添加SSH密钥使用key
- html5 画圆
- Java开发中的十个原则
- 读取资源(配置)文件的三种方式
- Windows Azure - Error of "MEDIA12899: AUDIO/VIDEO: Unknown MIME type" and Blob Storage
- 核心动画 CABasicAnimation
- 51nod 1267:4个数和为0 哈希
- SpringMVC表当重复提交