/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

3 votes317 views1 answer
Delete one specific character in string C++
C++
10 votes354 views2 answers
Ascii cpp
C++
1 vote352 views2 answers
C++ last element of array
C++
0 vote342 views1 answer
Border radius layout android xml
C++
0 vote326 views1 answer
C++ default constructor remove
C++
29 votes312 views6 answers
String to char*
C++
0 vote333 views1 answer
C++ check if vector is sorted
C++
0 vote329 views1 answer
Labs c++
C++
1 vote348 views1 answer
What is a .cpp file
C++
0 vote329 views1 answer
Program To Calculate Number Power Using Recursion In C++. The power number should always be positive integer.
C++