[CC150][2.2] Implement an algorithm to find the nth to last element of a singly linked list

nthToLast.java

import java.util.LinkedList;

public class nthToLast {
	public static<Item> Item find(LinkedList<Item> list, int n) {
		int N = list.size();
		if ( n < 1 || n > N) return null;
		int idx = N - n;
		return list.get(idx);
	}
	
	public static void main (String[] args) {
		LinkedList<Integer> test = new LinkedList<Integer>();
		for (int i = 0; i < 10; i++)
			test.add(i);
		
		System.out.println(find(test, 0));
		System.out.println(find(test, 1));
		System.out.println(find(test, 7));
		System.out.println(find(test, 10));
	}
}