给定一个链表,删除链表的倒数第 n 个节点,并且返回链表的头结点。
示例:
给定一个链表: 1->2->3->4->5, 和 n = 2.
当删除了倒数第二个节点后,链表变为 1->2->3->5.
说明:
给定的 n 保证是有效的。
进阶:
你能尝试使用一趟扫描实现吗?
思路
(1)保证了除了删除尾节点这种情况下的遍历一遍,基本思路与剑指Offer-链表-面试题22:链表中倒数第k个结点 一致。
(2)
解法1-AC
执行用时 :1 ms, 在所有 Java 提交中击败了56.92%的用户
内存消耗 :35 MB, 在所有 Java提交中击败了15.99%的用户
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
if(head == null || head.next==null){
return null;
}
ListNode fast = head;
ListNode slow = head;
//1.fast pointer
for(int i=0; i<n-1;i++){
fast = fast.next;
}
//2.to tail, pose the delete node
while( fast.next!= null){
fast =fast.next;
slow = slow.next;
}
//3.delete
if(slow.next != null){
slow.val = slow.next.val;
slow.next = slow.next.next;
}else{
slow = head;
while(slow.next.next!=null){
slow = slow.next;
}
slow.next = null;
}
return head;
}
}
解法2-虚拟头结点
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode first = dummy;
ListNode second = dummy;
// Advances first pointer so that the gap between first and second is n nodes apart
for (int i = 1; i <= n + 1; i++) {
first = first.next;
}
// Move first to the end, maintaining the gap
while (first != null) {
first = first.next;
second = second.next;
}
second.next = second.next.next;
return dummy.next;
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution/shan-chu-lian-biao-de-dao-shu-di-nge-jie-dian-by-l/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。