CC2.2 - Implement an algorithm to find the kth to last element of a singly linked list.

CC2.2

public class findKth {
	public static LinkedListNode solution(LinkedListNode head, int Kth) {
		if (Kth < 0) return null;
		if (head == null) return null;
		LinkedListNode walker = head;
		LinkedListNode runner = head;
		for (int i = 0; i < Kth-1; i++) {
			if (runner == null) return null;
			runner = runner.next;
		}
		while (runner.next != null) {
			walker = walker.next;
			runner = runner.next;
		}
		return walker;
	}

}

CC2.2-test

public class findKth {
	public static LinkedListNode solution(LinkedListNode head, int Kth) {
		if (Kth < 0) return null;
		if (head == null) return null;
		LinkedListNode walker = head;
		LinkedListNode runner = head;
		for (int i = 0; i < Kth-1; i++) {
			if (runner == null) return null;
			runner = runner.next;
		}
		while (runner.next != null) {
			walker = walker.next;
			runner = runner.next;
		}
		return walker;
	}

}