Easy Nth to Last Node in List
44%
Accepted
Find the nth to last element of a singly linked list.
The minimum number of nodes in list is n.
Yes
Example
Given a List 3->2->1->5->null and n = 2, return node whose value is 1.
/**
* 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) {
if(head == null || head.next == null){
return head;
}
int length = 1;
ListNode dummy = head;
while(head.next != null){
head = head.next;
length++;
}
int count = 0;
head = dummy;
while(head != null){
if(count == length-n){
return head;
}
head = head.next;
count++;
}
return null;
}
}