题目
找到单链表倒数第n个节点,保证链表中节点的最少数量为n。
样例
给出链表 3->2->1->5->null和n = 2,返回倒数第二个节点的值1.
解题
两个指针slow、fast
fast向前走n步后,slow和fast一起走,fast是最后一个结点时候,slow所指的结点就是答案
/**
* Definition for ListNode.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int val) {
* this.val = val;
* this.next = null;
* }
* }
*/
public class Solution {
/**
* @param head: The first node of linked list.
* @param n: An integer.
* @return: Nth to last node of a singly linked list.
*/
ListNode nthToLast(ListNode head, int n) {
// write your code here
if(head==null || n<=0)
return null;
ListNode slow = head;
ListNode fast = head;
while(n>1){
fast = fast.next;
n--;
}
while(fast.next!=null){
slow = slow.next;
fast = fast.next;
}
return slow;
}
}