/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 vote224 views1 answer
Iterate const vector
C++
0 vote216 views1 answer
Ordine crescente "senza" vettori in c++
C++
0 vote249 views1 answer
How to remove maximum number of characters in c++ cin,ignore
C++
4 votes221 views1 answer
Get index of value c++
C++
0 vote219 views1 answer
C++ program to print natural numbers from 1 to 10 in reverse order using while loop
C++
0 vote233 views1 answer
Come concatenare stringhe in c++
C++
0 vote223 views1 answer
Clean list widget qt
C++
0 vote223 views1 answer
Linux x11 copy paste event
C++
0 vote242 views1 answer
Creare array con c++
C++
4 votes210 views3 answers
C++ vector combine two vectors
C++