定义一个链表,给水浒108将作传
class HeroNode{
public int no;
public String name;
public String nickName;
public HeroNode next;
public HeroNode(int no, String name, String nickName) {
this.no = no;
this.name = name;
this.nickName = nickName;
}
@Override
public String toString() {
return "HeroNode{" +
"no=" + no +
", name='" + name + '\'' +
", nickName='" + nickName +
'}';
}
}
定义SingleLindList,管理我们的英雄
class SingleLindList{
private HeroNode head = new HeroNode(0,"","");
public HeroNode getHead() {
return head;
}
public void add(HeroNode heroNode){
HeroNode temp = head;
while (true){
if (temp.next == null){
break;
}
temp = temp.next;
}
temp.next=heroNode;
}
public void addByOrder(HeroNode heroNode){
HeroNode temp = head;
boolean flag = false;
while (true){
if (temp.next==null){
break;
}
if (temp.next.no>heroNode.no){
break;
}else if (temp.next.no == heroNode.no){
flag = true;
break;
}
temp = temp.next;
}
if (flag){
System.out.println("准备插入的英雄的编号已经存在了"+heroNode.no);
}else {
heroNode.next=temp.next;
temp.next = heroNode;
}
}
public void update(HeroNode newHeroNode){
if (head.next==null){
System.out.println("链表为空");
return;
}
HeroNode temp = head.next;
boolean flag = false;
while (true){
if (temp==null){
break;
}
if (temp.no==newHeroNode.no){
flag=true;
break;
}
temp = temp.next;
}
if (flag){
temp.name = newHeroNode.name;
temp.nickName = newHeroNode.nickName;
}else {
System.out.println("没有找到此编号的节点");
}
}
public void delete(int no){
HeroNode temp = head;
boolean flag = false;
while (true){
if (temp.next == null){
break;
}
if (temp.next.no == no){
flag = true;
break;
}
temp = temp.next;
}
if (flag){
temp.next = temp.next.next;
}else {
System.out.println("要删除的节点不存在");
}
}
public void list(){
if (head.next==null){
System.out.println("链表为空");
return;
}
HeroNode temp = head.next;
while (true){
if (temp==null){
break;
}
System.out.println(temp);
temp = temp.next;
}
}
}
进行测试
package util;
import java.util.Stack;
public class SingleLindListDemo {
public static void main(String[] args) {
HeroNode h1 = new HeroNode(1, "宋江", "及时雨");
HeroNode h2 = new HeroNode(2, "卢俊义", "玉麒麟");
HeroNode h3 = new HeroNode(3, "吴用", "智多星");
HeroNode h4 = new HeroNode(4, "林冲", "豹子头");
SingleLindList singleLindList = new SingleLindList();
singleLindList.addByOrder(h1);
singleLindList.addByOrder(h4);
singleLindList.addByOrder(h3);
singleLindList.addByOrder(h2);
singleLindList.list();
System.out.println("-----------------");
reversePrint(singleLindList.getHead());
}
public static int getLength(HeroNode heroNode) {
if (heroNode.next == null) {
return 0;
}
int length = 0;
HeroNode cur = heroNode.next;
while (cur != null) {
length++;
cur = cur.next;
}
return length;
}
public static HeroNode findNode(HeroNode node, int index) {
if (node.next == null) {
return null;
}
int size = getLength(node);
if (index <= 0 && index > size) {
return null;
}
HeroNode temp = node.next;
for (int i = 0; i < size - index; i++) {
temp = temp.next;
}
return temp;
}
public static void reverseHead(HeroNode heroNode) {
if (heroNode.next == null || heroNode.next.next == null) {
return;
}
HeroNode cur = heroNode.next;
HeroNode next = null;
HeroNode reverseHead = new HeroNode(0, "", "");
while (cur != null) {
next = cur.next;
cur.next = reverseHead.next;
reverseHead.next = cur;
cur = next;
}
heroNode.next = reverseHead.next;
}
public static void reversePrint(HeroNode head) {
if (head == null) {
return;
}
Stack<HeroNode> stack = new Stack<>();
HeroNode cur = head.next;
while (cur != null) {
stack.push(cur);
cur = cur.next;
}
while (stack.size() > 0) {
System.out.println(stack.pop());
}
}
}
HeroNode{no=1, name='宋江', nickName='及时雨}
HeroNode{no=2, name='卢俊义', nickName='玉麒麟}
HeroNode{no=3, name='吴用', nickName='智多星}
HeroNode{no=4, name='林冲', nickName='豹子头}
-----------------
HeroNode{no=4, name='林冲', nickName='豹子头}
HeroNode{no=3, name='吴用', nickName='智多星}
HeroNode{no=2, name='卢俊义', nickName='玉麒麟}
HeroNode{no=1, name='宋江', nickName='及时雨}