JasonChang

摘要： 1 public class Solution { 2 public int[] twoSum(int[] numbers, int target) { 3 HashMap visited = new HashMap(); 4 int[] result = new int[2]; 5 for(int i = 0; i < numbers.length; i++){ 6 int tmp = target - numbers[i]; 7 if(visited.containsKey(tmp))... 阅读全文

摘要： 1 public class Solution { 2 public ListNode addTwoNumbers(ListNode l1, ListNode l2) { 3 if(l1 == null) 4 return l2; 5 if(l2 == null) 6 return l1; 7 ListNode fakehead = new ListNode(0); 8 ListNode pre = fakehead; 9 int carry = 0;10 ... 阅读全文