/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 vote228 views1 answer
Vs_buildtools.exe --norestart --passive --downloadThenInstall --includeRecommended --add Microsoft.VisualStudio.Workload.NativeDesktop --add Microsoft.VisualStudio.Workload.VCTools --add Microsoft.VisualStudio.Workload.MSBuildTools
C++
0 vote214 views1 answer
Unique_ptr syntax
C++
1 vote231 views3 answers
Right shift in c++
C++
-1 vote219 views5 answers
C++ string split
C++
4 votes225 views3 answers
REFERENCE C++
C++
3 votes214 views2 answers
C++ vector element search
C++
174 votes206 views15 answers
Int to string c++
C++
0 vote221 views1 answer
Print each number of digit c++
C++
1 vote214 views1 answer
Sort a vector of strings according to their length c++
C++
1 vote307 views1 answer
Default access modifier in c++ in struct
C++