/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 vote263 views1 answer
Convert fahrenheit to celsius
C++
0 vote261 views1 answer
Irremoteesp8266 example
C++
0 vote285 views2 answers
How to use decrement operator in c++
C++
7 votes281 views5 answers
Stack c++
C++
4 votes270 views2 answers
C++ stream string into fiel
C++
2 votes258 views2 answers
Slice a vector c++
C++
0 vote258 views1 answer
C++ qt QFuture
C++
0 vote259 views3 answers
An array that take different data type c++
C++
0 vote249 views1 answer
What algorithm does bitcoin use
C++
1 vote244 views1 answer
Integer type validation c++
C++