/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

4 votes164 views1 answer
Sort vector struct c++
C++
2 votes152 views1 answer
Sfml draw tex
C++
3 votes170 views1 answer
Repeat character n times c++
C++
1 vote171 views1 answer
C++ vector of class objects
C++
8 votes157 views2 answers
Check file exist cpp
C++
1 vote173 views2 answers
How to find the size of a character array in c++
C++
15 votes173 views6 answers
Factorial
C++
0 vote187 views1 answer
Ue4 modular character
C++
0 vote179 views1 answer
How to use getline function inc
C++
0 vote205 views1 answer
How to print a word in c++
C++