LinkedList 中用递归的方法求最大⼀小数值.急,谢谢!!!!!!!!!!!!!!!!!!!!!!!

public static void main(String[] args){
LinkedList list = new LinkedList();
list.add(5);
list.add(4);
list.add(9);
list.add(0);
list.add(1000);
list.add(7000);
System.out.println(LinkedListMax(list, 0));
}
public static int LinkedListMax(LinkedList list, int max) {
if (list.isEmpty())
return max;
int tmp = Integer.parseInt(list.pop().toString());
return max > tmp ? LinkedListMax(list, max) : LinkedListMax(list, tmp);
}
你换成求最小,不用我说吧
但我只想说你这根本没必要啊,LinkedList本身就有个迭代为什么还要来用递归呢