/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 vote241 views1 answer
Sfml keyboard events cpp
C++
-1 vote260 views1 answer
Initialize variable in switch case c++
C++
0 vote236 views1 answer
C++ program to print natural numbers from 1 to 10 in reverse order using while loop
C++
0 vote303 views2 answers
. Shell sort in c++
C++
2 votes245 views2 answers
What is typedef
C++
3 votes236 views1 answer
Max three values c++
C++
0 vote251 views1 answer
C ++ split_string
C++
1 vote272 views1 answer
Right side pattern triangle c++
C++
0 vote251 views1 answer
Structure of s void function
C++
7 votes242 views2 answers
C++ threads
C++