/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 vote312 views1 answer
Cstring to string
C++
0 vote316 views2 answers
Accepting multiple values from a function in cpp
C++
3 votes299 views1 answer
How to convert qt string to string
C++
0 vote346 views1 answer
How to get steam id c++
C++
1 vote294 views1 answer
Union of two arrays leetcode
C++
0 vote332 views2 answers
C++ map key exists
C++
0 vote323 views1 answer
Creare array con c++
C++
0 vote376 views2 answers
C++ convert vector of digits into integer
C++
1 vote300 views1 answer
Explicit vs implicit c++
C++
0 vote314 views1 answer
Bit++ codeforces in c++
C++