题目
给定一个链表,删除链表的倒数第 n 个节点,并且返回链表的头结点。
示例:
给定一个链表: 1->2->3->4->5, 和 n = 2.
当删除了倒数第二个节点后,链表变为 1->2->3->5.
说明:n是有效的
解题
两次遍历算法
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode node = new ListNode(0);
node.next = head;
int length = 0;
while(head != null){
head = head.next;
length ++;
}
length -= n;
head = node;
while(length > 0){
head = head.next;
length --;
}
head.next = head.next.next;
return node.next;
}
}
一次遍历算法
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode node = new ListNode(0);
node.next = head;
ListNode firstNode = node;
ListNode secondNode = node;
secondNode.next = head;
for(int i = 0; i <= n ; i ++){
firstNode = firstNode.next;
}
while(firstNode != null){
firstNode = firstNode.next;
secondNode = secondNode.next;
}
secondNode.next = secondNode.next.next;
return node.next;
}
}