关于单链表的实现 请参考blog
/*
* @param herd 链表的头节点
* 将链表反转
* */
public static void reverseList(HeroNode head){
if (head.next == null || head.next.next == null)
return;
HeroNode cur = head.next;
HeroNode next; //保存当前节点的下一个节点 防止节点丢失
HeroNode reverseHead = new HeroNode(0,"","");
while (cur != null){
next = cur.next;
cur.next = reverseHead.next; //cur的下一个节点指向新的链表的最前端
reverseHead.next = cur; //将cur 连接到新的链表上
cur = next;
}
head.next = reverseHead.next;
}