如题:
有某链表如下:
public class LinkNode {
private int value;
private LinkNode nextNode;
}
请用递归求链表值最大的节点,实现如下:
package com;
/**
* 递归获取单链表值最大的节点
*
* @author CaoZP
*
*/
public class LinkNode {
private int value;
private LinkNode nextNode;
public LinkNode() {
}
public LinkNode(int value) {
this.value = value;
}
public LinkNode(int value, LinkNode nextNode) {
this.value = value;
this.nextNode = nextNode;
}
public int getValue() {
return value;
}
public void setValue(int value) {
this.value = value;
}
public LinkNode getNextNode() {
return nextNode;
}
public void setNextNode(LinkNode nextNode) {
this.nextNode = nextNode;
}
@Override
public String toString() {
return "LinkNode [value=" + value + ", nextNode=" + nextNode +