sum
mars2014jia
这个作者很懒,什么都没留下…
展开
-
2sum
ref http://www.cnblogs.com/springfor/p/3859618.html // hash soln public class Solution { public int[] twoSum(int[] numbers, int target) { // hashmap soln if(numbers=转载 2015-03-07 06:57:34 · 248 阅读 · 0 评论 -
3sum
ref http://www.cnblogs.com/springfor/p/3859670.html public ArrayList> threeSum(int[] num) { ArrayList> res = new ArrayList>(); if(num==null || num.length转载 2015-03-09 12:34:10 · 163 阅读 · 0 评论 -
4sum
public class Solution { public ArrayList> fourSum(int[] num, int target) { ArrayList> res = new ArrayList>(); if(num==null || num.length Arrays.sort(num); //转载 2015-03-09 13:28:07 · 216 阅读 · 0 评论 -
two sum 攻
I 非排好序,最快O(n), 用hashmap解决 public class Solution { public int[] twoSum(int[] numbers, int target) { int[] res = new int[2]; HashMap hm = new HashMap(); if(numbers==null |转载 2015-04-04 04:18:20 · 218 阅读 · 0 评论