Given a linked list, remove the nth node from the end of list and return its head.
For example,
Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
Given n will always be valid.
Try to do this in one pass.
Have you met this question in a real interview?
代码如下:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
if(head.next==null) return null;
ListNode pre = null;
ListNode p1 = head;
ListNode p2 = head;
while(n>1){
p2 = p2.next;
n--;
}
while(p2.next!=null){
pre = p1;
p1 = p1.next;
p2 = p2.next;
}
//要删除的是链表的第一个元素
if(pre == null){
return head.next;
}
pre.next = p1.next;
return head;
}
}
画个图代码就比较容易得到了。