/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 vote175 views1 answer
Binary exponentiation modulo m
C++
0 vote170 views1 answer
C++ pass char array by reference
C++
0 vote183 views1 answer
Use textchanged qt cpp
C++
-2 votes174 views2 answers
C++ for
C++
0 vote203 views3 answers
How to make loop in c++
C++
0 vote173 views1 answer
C++ typeid get type name
C++
1 vote163 views1 answer
Matrix layout in C++
C++
-6 votes173 views3 answers
Explicit in c++ meaning
C++
0 vote201 views1 answer
How to know datatype of something in c++
C++
0 vote161 views1 answer
Flowchart to display factors of a number
C++