一、题目描述
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。进阶:你能尝试使用一趟扫描实现吗?
二、提示
链表中结点的数目为 sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
三、示例
示例 1:
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
示例 2:
输入:head = [1], n = 1
输出:[]
示例 3:
输入:head = [1,2], n = 1
输出:[1]
四、代码
package q19删除链表的倒数第N个结点;
public class Main {
public static void main(String[] args) {
ListNode list1;
ListNode list2;
ListNode list3;
ListNode list4;
ListNode list5 = new ListNode(5);
list4 = new ListNode(4, list5);
list3 = new ListNode(3, list4);
list2 = new ListNode(2, list3);
list1 = new ListNode(1, list2);
ListNode listNode = removeNthFromEnd(list4, 2);
System.out.println(listNode);
}
public static ListNode removeNthFromEnd(ListNode head, int n) {
ListNode p = head;
int num = 1;
while (p.next != null) {
p = p.next;
num++;
}
p = head;
int count = 0;
if (num == n) {
return head.next;
}
while (p.next != null) {
count++;
if (count == num - n) {
p.next = p.next.next;
return head;
}
p = p.next;
}
return null;
}
}
class ListNode {
int val;
ListNode next;
ListNode() {
}
ListNode(int val) {
this.val = val;
}
ListNode(int val, ListNode next) {
this.val = val;
this.next = next;
}
@Override
public String toString() {
return "ListNode{" +
"val=" + val +
", next=" + next +
'}';
}
}