/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

1 vote86 views1 answer
Qt popup window
C++
18 votes122 views4 answers
Length of array in cpp
C++
2 votes113 views1 answer
Runtime Error: Runtime ErrorBad memory access (SIGBUS)
C++
0 vote130 views1 answer
How to sort array in c++ stockoverflow
C++
1 vote120 views2 answers
C++ regex to validate indian phone number pattern
C++
0 vote115 views1 answer
Pause the console c++
C++
1 vote204 views1 answer
Class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) meaning
C++
0 vote128 views1 answer
Operand-- c++
C++
0 vote204 views1 answer
Dynamically allocate a string object and save the address in the pointer variable p.
C++
0 vote113 views1 answer
Disallowcopy c++
C++