/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

13 votes327 views4 answers
Stl sort in c++
C++
1 vote326 views3 answers
Array Rotate in c++
C++
0 vote350 views1 answer
Raspberry pi mount external hard drive
C++
0 vote310 views1 answer
Clear qlayout
C++
0 vote329 views1 answer
All usefull stls in cpp imports
C++
0 vote360 views1 answer
Log base 2 in c++
C++
1 vote369 views1 answer
C++ isalphanum
C++
21 votes328 views6 answers
Cin c++
C++
0 vote373 views1 answer
How to write a template c++
C++
0 vote339 views2 answers
QVariant to int
C++