给定一个链表,删除链表中倒数第n个节点,返回链表的头节点。
Given a linked list, remove the nth node from the end of list and return its head.
样例
给出链表1->2->3->4->5->null和 n = 2.
删除倒数第二个节点之后,这个链表将变成1->2->3->5->null.
Example
Given linked list: 1->2->3->4->5->null, and n = 2.
After removing the second node from the end, the linked list becomes 1->2->3->5->null.
注意
链表中的节点个数大于等于n
Note
The minimum number of nodes in list is n.
挑战
O(n)时间复杂度
Challenge
O(n) time
/**
* Definition for ListNode.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int val) {
* this.val = val;
* this.next = null;
* }
* }
*/
public class Solution {
/**
* @param head: The first node of linked list.
* @param n: An integer.
* @return: The head of linked list.
*/
ListNode removeNthFromEnd(ListNode head, int n) {
if(n == 0)return head;
ListNode p = head, q = head;
while (n > 0 && null != p.next) {
p = p.next;
n--;
}
if(n > 0) {
head = head.next;
return head;
}
while(null != p.next) {
p = p.next;
q = q.next;
}
q.next = q.next.next;
return head;
}
}