/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

5 votes179 views3 answers
C++ console color
C++
0 vote193 views1 answer
Error: ‘memset’ was not declared in this scope in cpp
C++
-1 vote219 views1 answer
Arrays left rotation hackerrank solution
C++
0 vote177 views1 answer
Square gcode
C++
0 vote184 views1 answer
Unreal ensureMsgf example
C++
0 vote181 views1 answer
Directed graph in cpp
C++
0 vote195 views1 answer
C++ public inheritance not getting protected
C++
1 vote230 views1 answer
How to return 2d array from function c++
C++
5 votes203 views1 answer
Singleton c++
C++
0 vote177 views1 answer
C++ rgb code
C++