/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 votes127 views3 answers
Class cpp
C++
0 vote109 views3 answers
C++ loop through list
C++
0 vote113 views1 answer
Cpp cout more than 1 value
C++
4 votes112 views3 answers
C plus
C++
3 votes65 views1 answer
(a) one-dimensional arrays and multidimensional arrays in c++
C++
1 vote114 views1 answer
Std::stack
C++
0 vote124 views1 answer
C++ get pointer from unique_ptr
C++
0 vote103 views1 answer
Not c++
C++
0 vote115 views1 answer
Cuda locks
C++
5 votes110 views1 answer
How to use comparator funtion in priority queue in c++
C++