题目
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.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
思路
这个问题的核心就在于只遍历一次,如果允许两次则很好解决、先第一遍遍历知道链表长度、第二遍就直接除去倒数第N个结点了。
只遍历一次我们就想,遍历结束的标志就是指向为空、从指向为空的结点往前数N个点即为目标结点,也就是说目标结点与结束标志相差为N,那么我们就可以设置两个指针p和q,中间相差为N,两个指针同步向后走,那么p(假设在前面)指向为空的时候,那么q就自然为目标指针了,剩下就完成删除结点的操作。
代码
public class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode p = new ListNode(0);
ListNode q = p;
ListNode result = p;
p.next = head;
for(int i = 0 ; i <= n ; ++ i){
p = p.next;
}
while(p != null){
p = p.next;
q = q.next;
}
q.next = q.next.next;
return result.next;
}
}