/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 vote334 views1 answer
C++ write string
C++
0 vote296 views1 answer
Mkdir c++
C++
12 votes294 views2 answers
Comparator in sort c++
C++
0 vote356 views1 answer
Pimpl c++
C++
1 vote340 views1 answer
Class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) meaning
C++
5 votes298 views1 answer
Qdebug
C++
22 votes317 views2 answers
DateFormat in Flutter
C++
0 vote370 views1 answer
Cpp serial print override always in same place
C++
0 vote326 views1 answer
Std::random_device
C++
1 vote311 views1 answer
Ue4 find component c++
C++