/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 vote158 views1 answer
Do c++ ints neeed to be initlaized
C++
0 vote108 views2 answers
Shell sort descending order c++
C++
0 vote157 views1 answer
Check whether kth bit is 1
C++
0 vote132 views1 answer
Vector of int to string c++
C++
0 vote153 views1 answer
Binpow in fenwick tree
C++
1 vote155 views1 answer
C++ ::
C++
2 votes135 views6 answers
Loop in c++
C++
0 vote163 views1 answer
Opencv c++ feature detection
C++
4 votes140 views1 answer
C++ show time elapsed
C++
0 vote142 views1 answer
Cuda locks
C++