/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 vote160 views1 answer
Write a C++ program to Computing Mean and Median Using Arrays
C++
0 vote155 views1 answer
Txt auslesen c++
C++
1 vote140 views1 answer
Fiunction in c++
C++
2 votes154 views1 answer
C++ get file content
C++
2 votes143 views1 answer
Rng c++
C++
6 votes139 views3 answers
Convert set to vector c++
C++
0 vote138 views1 answer
C++ sum a vector of digits
C++
0 vote180 views1 answer
Quicksort taking random pivot
C++
0 vote161 views1 answer
Destiny child
C++
0 vote141 views1 answer
Generate random ints and floats
C++