/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 vote164 views1 answer
Remove last index of the string in c++
C++
0 vote125 views1 answer
How to traverse string like array in cpp
C++
-1 vote143 views1 answer
Attention nlp
C++
0 vote125 views1 answer
Oncomponentbeginoverlap ue4 c++
C++
0 vote136 views1 answer
Emplace vs push c++
C++
0 vote169 views1 answer
Vs Code cpp not run
C++
1 vote133 views1 answer
Gestd::getline with wstring
C++
0 vote138 views1 answer
Gcc suppress warning inline
C++
0 vote133 views1 answer
What is c++ used for
C++
1 vote93 views1 answer
Add element to start of vector c++
C++