原题
给定一个链表,删除链表的倒数第 n 个节点,并且返回链表的头结点。
示例:
给定一个链表: 1->2->3->4->5, 和 n = 2.
当删除了倒数第二个节点后,链表变为 1->2->3->5.
说明:
给定的 n 保证是有效的。
进阶:
你能尝试使用一趟扫描实现吗?
通过代码:
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode f = head;
ListNode s = head;
for (int i = 0; i < n; i++) {
f = f.next;
}
if(f == null) {
return head = head.next;
}
while(f.next!=null) {
f = f.next;
s = s.next;
}
s.next = s.next.next;
return head;
}
}
提供一份IDE自测代码:
import org.junit.Test;
public class SolutionTest {
/**
*删除链表的倒数第N个节点
*/
public ListNode removeNthFromEnd(ListNode head, int n) {
ListNode f = head;
ListNode s = head;
for (int i = 0; i < n; i++) {
f = f.next;
}
if(f == null) {
return head = head.next;
}
while(f.next!=null) {
f = f.next;
s = s.next;
}
s.next = s.next.next;
return head;
}
/**
* 打印链表
*/
public static void printList(ListNode head){
if(null == head){
return;
}
while(head.next!=null) {
System.out.print(head.val+"->");
head = head.next;
}
System.out.println(head.val);
}
@Test
public void listTest(){
ListNode head = new ListNode(1);
head.next = new ListNode(2);
head.next.next = new ListNode(3);
head.next.next.next = new ListNode(4);
head.next.next.next.next = new ListNode(5);
head = removeNthFromEnd(head, 3);
printList(head);
}
}