每日一练_45(2021.7.24) 删除链表的第N个结点(LeetCode)。

最新推荐文章于 2024-07-20 00:51:00 发布

原创最新推荐文章于 2024-07-20 00:51:00 发布 · 147 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java

菜鸟的每天一练。专栏收录该内容

118 篇文章

订阅专栏

本文讲解了如何使用Java实现LeetCode中的删除链表倒数第N个节点问题，通过ListNode类实现链表操作，包括添加节点、获取链表长度和删除指定位置节点。示例代码详细展示了整个过程，适合初学者理解链表操作技巧。

老规矩，官方代码：作者：LeetCode-Solution
链接：https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution/shan-chu-lian-biao-de-dao-shu-di-nge-jie-dian-b-61/
来源：力扣（LeetCode）

个人微改：
import java.util.*;
class ListNode{
   int val;
   ListNode next;
   ListNode() {}
   ListNode(int val){this.val=val;}
   ListNode(int val,ListNode next){this.val = val;this.next=next;}

   public void addNode(int e) {
       ListNode newNode = new ListNode(e);
       if(this.next==null) {
           this.next = newNode;
       }else {
           this.next.addNode(e);
       }
   }

   public ListNode remove(ListNode head,int n) {
       ListNode rookie = new ListNode(0,head);
       int length = getLength(head);
       ListNode cur = rookie;
       for(int i=1;i<length-n+1;i++) {
           cur = cur.next;
       }
       cur.next = cur.next.next;
       ListNode ans = rookie.next;
       return ans;
   }
   public int getLength(ListNode head) {
       int length = 0;
       while(head!=null) {
           ++length;
           head = head.next;
       }
       return length;
   }
   public void print() {
       System.out.print(this.val);
       if(this.next!=null) {
           System.out.print("-->");
           this.next.print();
       }
   }
}
public class deleteLinkList {
   public static void main(String args[]) {
       ListNode L1 = new ListNode();
       System.out.println("please enter the linked list capacity :");
       Scanner sc = new Scanner(System.in);
       int m = sc.nextInt();
       int a[] = new int[m];
       System.out.println("please enter the data of your linked list :");
       for(int i=0;i<m;i++) {
           a[i]=sc.nextInt();
           L1.addNode(a[i]);
       }
       System.out.println("please enter the number of reciprocal of the list you want to delete :");
       int n = sc.nextInt();
       L1.remove(L1.next,n);
       L1.next.print();
       sc.close();

   }
}
测试结果：

please enter the linked list capacity :
5
please enter the data of your linked list :
1 2 3 4 5
please enter the number of reciprocal of the list you want to delete :
2
1-->2-->3-->5