/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 vote269 views1 answer
Int main() {
C++
7 votes294 views2 answers
Qt int to string
C++
1 vote256 views1 answer
Integer type validation c++
C++
0 vote281 views1 answer
Unreal engine overlap events c++ code
C++
0 vote256 views1 answer
Zero fill in c++
C++
0 vote256 views1 answer
C++ throw index out of bound
C++
0 vote333 views1 answer
Cpp serial print override always in same place
C++
-1 vote267 views1 answer
Sinonimo de tratar
C++
2 votes286 views1 answer
Unity failed to load window layout
C++
2 votes268 views1 answer
Cannot find "-lsqlite3" C++
C++