/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 vote181 views1 answer
Vector erase not working c++
C++
6 votes159 views1 answer
C++ estimate deciimal to a point
C++
13 votes167 views3 answers
? in cpp
C++
0 vote201 views2 answers
C++ 14 for sublime windoes build system
C++
0 vote157 views1 answer
C++ enum rand
C++
0 vote172 views1 answer
Header for INT_MIN
C++
0 vote202 views1 answer
C++ preprocessor commands
C++
4 votes132 views2 answers
Poland
C++
0 vote162 views1 answer
C++ define array with values
C++
0 vote165 views1 answer
How to convert int to FString c++ ue4
C++