/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 vote188 views3 answers
Right shift in c++
C++
0 vote175 views1 answer
Appending int to string in cpp
C++
0 vote174 views1 answer
Windows install cppcheck
C++
-1 vote210 views1 answer
2927260.eps 2927262.jpg 2927263.ai License free.txt License premium.txt
C++
1 vote179 views1 answer
Prime numbers less than a given number c++
C++
0 vote211 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
3 votes229 views6 answers
C++ for loops
C++
0 vote185 views1 answer
Matrix dynamic memory c++
C++
-1 vote184 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
9 votes171 views3 answers
How to iterate in string in c++
C++