LeetCode——TwoSum
2016-01-29 17:04
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我的解法:
public class Solution { public int[] twoSum(int[] numbers, int target) { int [] re=new int[2]; int len=numbers.length; for(int i=0;i<len;i++){ for(int j=i+1;j<len;j++){ if(numbers[i]+numbers[j]==target){ re[0]=i+1; re[1]=j+1; } } } return re; } }系统给出结果:
Time Limit Exceeded
显然系统无法忍受我时间复杂度为O(n^2)的时间复杂度。在讨论版看到一个复杂度为O(n)的算法:
import java.util.Hashtable; public class Solution { public int[] twoSum(int[] numbers, int target) { int [] re=new int[2]; Hashtable<Integer,Integer> hashtable=new Hashtable<Integer,Integer>(); int len=numbers.length; for(int i=0;i<len;i++){ Integer n=hashtable.get(numbers[i]); if(n==null) hashtable.put(numbers[i],i); n=hashtable.get(target-numbers[i]); if(n!=null&&n<i){ re[0]=n+1; re[1]=i+1; return re; } } return re; } }
相关文章推荐
- 一文读懂机器学习,大数据/自然语言处理/算法全有了……
- jquery-mousewheel 插件
- dblink嵌套场景下 查询出现:ORACLE ORA-00600错误的解决
- 【敬业福bug】支付宝五福卡敬业福太难求 被炒至200元
- 关于OPENGL与OPENGL ES的区别
- codeforces 608B Hamming Distance Sum 部分和+思路转换
- 简单理解socket基础知识
- 素数判断和素数筛法
- xcode编包时code sign报错:User interaction is not allowed
- 浅谈CRM系统之客户数据分析
- 使用七牛云存储解决ios7.1的app部署问题
- Garbage Heap
- CocoaPosd详解
- thinkPHP的字母函数
- 使用转场动画构造侧滑
- shell编程-变量
- 最小的k个数
- oracle 11.2.0.3 设置启动脚本使ORACLE自动启动
- JavaScript 数据类型
- vi/vim基本使用方法