给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
示例 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]
提示:
链表中结点的数目为 sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
/**
* 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) {
Map<Integer,ListNode> hashMap=new HashMap<>();//用map存放对应位置的节点
ListNode temp=head;
int index=1;
while(temp != null){
hashMap.put(index,temp);
index++;
temp=temp.next;
}
int size=hashMap.size();
if(size == 1){
head = null;
return head;
}
if(n == 1){
hashMap.get(size-1).next=null;
}else if(n == size){
head=head.next;
}else{
hashMap.get(size-n).next=hashMap.get(size-n+2);
}
return head;
}
}