/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 vote177 views1 answer
C++ load file as vector
C++
41 votes187 views6 answers
Print hello world c++
C++
1 vote152 views1 answer
Ue4 find component c++
C++
0 vote153 views1 answer
Convert vector into array c++
C++
0 vote148 views1 answer
Restart the computer in c++ after the default time (30) seconds. (Windows)
C++
-2 votes160 views1 answer
Double pointers C++
C++
0 vote165 views1 answer
High school hacking competition
C++
0 vote176 views1 answer
C++ check if vector is sorted
C++
1 vote138 views1 answer
Get the element at an index list c++
C++
1 vote163 views1 answer
How to loop a 2 dimensional vector in c++ starting from second element
C++