/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 vote163 views1 answer
C++ expected an identifier
C++
2 votes122 views1 answer
Read int from file c++
C++
0 vote158 views1 answer
C++ read entire file into a variable
C++
3 votes168 views2 answers
Search in vector of pairs c++
C++
6 votes171 views1 answer
How to initialize array with new in c++
C++
0 vote192 views1 answer
Kmp c++
C++
1 vote186 views2 answers
Auto i cpp
C++
2 votes158 views1 answer
Binary search return index c++
C++
1 vote215 views1 answer
Remove last index of the string in c++
C++
1 vote163 views2 answers
Check if number is positive or negative in cpp
C++