/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 vote305 views1 answer
C++ find object in vector by attribute
C++
1 vote322 views1 answer
Create file c++
C++
10 votes326 views2 answers
Ascii cpp
C++
0 vote349 views1 answer
How to display score using SDL in c++
C++
1 vote297 views1 answer
C++ remove text file
C++
37 votes403 views2 answers
Remove element by index from vector c++
C++
17 votes325 views2 answers
How to output to console c++
C++
0 vote347 views4 answers
Define for loop c++
C++
-1 vote284 views1 answer
Program to check smallest num in three numbers in c++
C++
2 votes309 views3 answers
C++ lambda
C++