与查找链表的倒数第N个节点对比只改动了一行:查到倒数第N个节点后,将该节点的后续指针p1.next = p1.next.next;即可
package 链表中;
public class NthNodeFromEndOfList {
/**
* 获取链表的长度
*/
public static int lengthOfList(ListNode head) {
int m = 0;
ListNode p = head;
while(p != null) {
m++;
p = p.next;
}
return m;
}
/**
* 删除倒数第N个节点
* @param args
*/
public static ListNode removeNthFromEnd(ListNode head, int n ) {
ListNode p1 = head;
ListNode p2 = head;
for (int i = 0; i
关注
打赏