链表
原题链接
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
示例 1:
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
示例 2:
输入:head = [1], n = 1
输出:[]
题解
比较简单 不在赘述
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode dummy = new ListNode(-1);
dummy.next = head;
int l = 0 ;
for(ListNode p = dummy ; p != null ; p = p.next)l++;
ListNode p = dummy ;
for(int i =0 ; i < l - n -1 ; i++) p = p.next;
p.next = p.next.next ;
return dummy.next;
}
}