/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

2 votes133 views1 answer
Who to include a library c++
C++
2 votes183 views2 answers
Include cpp
C++
0 vote145 views1 answer
C++ std::find with lambda
C++
0 vote141 views1 answer
C++ argument list for class template is missing
C++
0 vote139 views1 answer
Bnchch
C++
0 vote149 views3 answers
Print counting in c++
C++
1 vote152 views1 answer
Std::tuple apply multiplier
C++
2 votes133 views2 answers
Slice a vector c++
C++
18 votes130 views4 answers
How to string to integer in c++
C++
1 vote134 views1 answer
How to modify set C++
C++