/C++/Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.

Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.

LinkedListNode nthToLast(LinkedListNode head, int n) {
  if (head == null || n < 1) {
    return null;
  }

  LinkedListNode p1 = head;
  LinkedListNode p2 = head;

  for (int j = 0; j < n - 1; ++j) { // skip n-1 steps ahead
    if (p2 == null) {
      return null; // not found since list size < n
    }
    p2 = p2.next;
  }

  while (p2.next != null) {
    p1 = p1.next;
    p2 = p2.next;
  }

  return p1;
}

Source: stackoverflow.com

Similar codes

0 vote277 views2 answers
Greatest and smallest in 3 numbers cpp
C++
0 vote301 views1 answer
C++ count vector elements
C++
0 vote294 views1 answer
At c++ vector
C++
1 vote352 views1 answer
Can you verify adsense no ssl certificate
C++
5 votes270 views1 answer
Exit() in c++
C++
6 votes284 views2 answers
Indexing strings in c++
C++
0 vote273 views1 answer
How to get max grade c++
C++
0 vote302 views1 answer
Bash find into array
C++
0 vote299 views1 answer
Use regex replace in c++
C++
0 vote281 views1 answer
C++ std::find with lambda
C++