19. Remove Nth Node From End of List

最新推荐文章于 2024-04-23 17:09:00 发布

zg1g

最新推荐文章于 2024-04-23 17:09:00 发布

阅读量713

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode linkedlist delete

本文链接：https://blog.csdn.net/daigualu/article/details/73033225

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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 {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode RemoveNthFromEnd(ListNode head, int n) {
        ListNode tmp = head;
        int sn=0;//node count;
        while(tmp!=null){
            tmp=tmp.next;
            sn++;
        }
        //tmp points to head again
        tmp=head;
        int psn=sn-n,i=1;
        //after jumping loof, 
        //tmp points to previous node that would be deleted
        while(i++<psn){
            tmp=tmp.next;
        }
        if(psn==0) head = tmp.next; //solving previous node not existence
        else if(n==1) tmp.next=null; //deleting last node;
        else tmp.next=tmp.next.next;
        return head;
    }
}