面试题解答系列：数组与链表

LeetCode相关题目参考

1.两数之和

参考答案：

class Solution {
public int[] twoSum(int[] numbers, int target) {
int [] res = new int[2];
if(numbers==null||numbers.length<2)
return res;
HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
for(int i = 0; i < numbers.length; i++){
if(!map.containsKey(target-numbers[i])){
map.put(numbers[i],i);
}else{
res[0]= map.get(target-numbers[i]);
res[1]= i;
break;
}
}
return res;
}
}
2.两数相加

参考答案：

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(0);
ListNode p = l1, q = l2, curr = dummyHead;
int carry = 0;
while (p != null || q != null) {
int x = (p != null) ? p.val : 0;
int y = (q != null) ? q.val : 0;
int sum = carry + x + y;
carry = sum / 10;
curr.next = new ListNode(sum % 10);
curr = curr.next;
if (p != null) p = p.next;
if (q != null) q = q.next;
}
if (carry > 0) {
curr.next = new ListNode(carry);
}
return dummyHead.next;
}
19.删除链表的倒数第N个节点

我的答案：（13ms）

public ListNode removeNthFromEnd(ListNode head, int n) {
// 正确性判断 if (null == head || null == head.next) {
return null;
}
int num = 0;
// 定义一个虚拟头结点方便遍历链表 ListNode dummyHead = new ListNode(-1);
dummyHead.next = head;
ListNode prev = dummyHead;
// 一次遍历找到链表的总数 while (null != prev.next) {
num++;
prev = prev.next;
}
// 二次遍历删除对应的节点 prev = dummyHead;
for (int i = 0; i < num - n; i++) {
prev