题解 | #删除链表的倒数第n个节点#
删除链表的倒数第n个节点
https://www.nowcoder.com/practice/f95dcdafbde44b22a6d741baf71653f6
import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * } * } */ public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * @param head ListNode类 * @param n int整型 * @return ListNode类 */ public ListNode removeNthFromEnd (ListNode head, int n) { // write code here if(head==null || n<1){ return head; } ListNode p=head,q=p,s=q; while(p!=null){ n--; if(n<0){ break; } p=p.next; } if(n>0){ return head; } while(p!=null){ p=p.next; s=q; q=q.next; } if(q==head){ head=head.next; }else{ s.next=q.next; } return head; } }