/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 vote98 views5 answers
C++ string split
C++
0 vote123 views1 answer
Define unicode c++
C++
1 vote125 views1 answer
Default access specifier in c++
C++
1 vote134 views1 answer
Hi cpp
C++
0 vote105 views1 answer
C++ insertion in astack
C++
0 vote106 views1 answer
C++ iterate over vector of pointers
C++
1 vote99 views1 answer
C++ read file to char buffer
C++
8 votes98 views3 answers
Sum elements in vector c++
C++
0 vote104 views1 answer
How to clear a string in c++
C++
0 vote96 views2 answers
C++ string to wstring
C++