题目
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
示例 1:
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
分析
这道题目要求只遍历一次。删除倒数第n个结点,如果这个结点刚好是头结点那么应该返回头结点的 next结点,如果不是则可以通过pre和cur指针来实现,让cur指针往前走n步,然后和pre指针同时往前走,当cur走到最后一个结点的时候pre指针刚好是待删除结点的前序结点
public class LinkNode {
int val;
LinkNode next;
public LinkNode(int data) {
this.val = data;
this.next = null;
}
}
public class LinkList {
LinkNode head;
public LinkList() {
this.head = null;
}
public LinkNode getHead() {
return this.head;
}
//添加元素
public void addNode(int data) {
LinkNode node = new LinkNode(data);
if (this.head == null) {
this.head = node;
} else {
LinkNode cur = this.head;
while(cur.next != null) {
cur = cur.next;
}
cur.next = node;
}
}
//正序打印
public void print(LinkNode node) {
while(node != null) {
System.out.print(node.val);
System.out.print(" ");
node = node.next;
}
System.out.println();
}
public void deletNdata(int n) {
LinkNode cur = this.head;
LinkNode pre = this.head;
for(int i = 0;i<n;i++) {
cur = cur.next;
if(cur == null) {
print(this.head.next);
return;
}
}
while(cur.next != null) {
cur = cur.next;
pre = pre.next;
}
pre.next = pre.next.next;
print(this.head);
}
}
public class removeNthNodeFromEndofList {
public static void main(String[] args) {
LinkList list = new LinkList();
list.addNode(1);
list.addNode(2);
list.addNode(3);
list.addNode(4);
list.addNode(5);
list.deletNdata(2);
}
}