/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

1 vote313 views2 answers
C++ random between two values
C++
0 vote283 views1 answer
C++ find object in vector by attribute
C++
1 vote299 views1 answer
Fiunction in c++
C++
2 votes303 views1 answer
Runtime Error: Runtime ErrorBad memory access (SIGBUS)
C++
0 vote298 views1 answer
ImportError: cannot import name 'TFLiteConverter' from 'tensorflow.lite'
C++
0 vote289 views1 answer
Shrek c++
C++
0 vote297 views1 answer
9+20
C++
0 vote286 views6 answers
Python converter to c
C++
0 vote305 views1 answer
Power of two c++
C++
-1 vote285 views1 answer
Standard input c++
C++