/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 vote264 views1 answer
Statement that causes a function to end in c++
C++
22 votes313 views4 answers
Cpp get last element of vector
C++
1 vote333 views1 answer
Parallelize for loop c++
C++
6 votes267 views1 answer
Convert string to stream c++
C++
30 votes245 views10 answers
Google translate
C++
1 vote276 views1 answer
Qt window bottom bar
C++
0 vote272 views1 answer
Phi function (n log (log(n)))
C++
0 vote274 views1 answer
Qt how to make a file browser
C++
1 vote248 views1 answer
Explicit vs implicit c++
C++
0 vote252 views1 answer
Jquery ajax post json asp.net core
C++