题解 | #删除链表的倒数第n个节点#
删除链表的倒数第n个节点
http://www.nowcoder.com/practice/f95dcdafbde44b22a6d741baf71653f6
import java.util.*;
/*
* public class ListNode {
* int val;
*/
public class Solution {
/**
*
* @param head ListNode类
* @param n int整型
* @return ListNode类
*/
public ListNode removeNthFromEnd (ListNode head, int n) {
// write code here
ListNode res = new ListNode(-1); //创建链表头结点
res.next = head;
ListNode pre= res;
ListNode cur = head;
ListNode fast = head;
while(n != 0){//先让快指针走n步
fast = fast.next;
n--;
}
while(fast != null){//快慢指针同步
fast = fast.next;
pre = cur;
cur = cur.next;
}
pre.next = cur.next;//删除第n个节点
return res.next;
}
}
/*
* public class ListNode {
* int val;
* ListNode next = null;
* }*/
public class Solution {
/**
*
* @param head ListNode类
* @param n int整型
* @return ListNode类
*/
public ListNode removeNthFromEnd (ListNode head, int n) {
// write code here
ListNode res = new ListNode(-1); //创建链表头结点
res.next = head;
ListNode pre= res;
ListNode cur = head;
ListNode fast = head;
while(n != 0){//先让快指针走n步
fast = fast.next;
n--;
}
while(fast != null){//快慢指针同步
fast = fast.next;
pre = cur;
cur = cur.next;
}
pre.next = cur.next;//删除第n个节点
return res.next;
}
}
曼迪匹艾公司福利 136人发布