java数据结构之linkedList

地址	data域	next域
110	A2	130
120	A4	140
130	A3	120
140	A5	NULL
150	A1	110

特点：

• 链表以节点的方式来存储，是链式存储结构，但在屋里内存中不一定是连续的地址，是通过逻辑指针实现的连续链表。
• 每个节点包含data域（存储数据）和next域（指向下一节点）。
• 链表分为带头节点和不带头节点两种。

JAVA代码模拟单链表的创建和遍历

public class linkedListDemo {
	public static void main(String[] args) {
		SingleLinkedList singleLinkedList = new SingleLinkedList();
		HeroNode hero1 = new HeroNode(1, "王二", "二狗");
		HeroNode hero2 = new HeroNode(2, "张三", "三胖");
		HeroNode hero3 = new HeroNode(3, "李四", "四块");
		singleLinkedList.add(hero1);
		singleLinkedList.add(hero2);
		singleLinkedList.add(hero3);
		singleLinkedList.show();
	}
}
class SingleLinkedList{
	private HeroNode head = new HeroNode(0, "", "");
	public void add(HeroNode heroNode) {
		HeroNode temp = head;
		while(true) {
			if(temp.next==null) {
				break;
			}
			temp = temp.next;
		}
		temp.next = heroNode;
	}
	public void show() {
		HeroNode temp = head.next;
		while(temp!=null) {
			System.out.println(temp);
			temp = temp.next;
		}
	}
}
class HeroNode{
	public int No;
	public String name;
	public String nickName;
	public HeroNode next;
	public HeroNode(int no, String name, String nickName) {
		super();
		No = no;
		this.name = name;
		this.nickName = nickName;
	}
	@Override
		public String toString() {
		return "heroNode [No=" + No + ", name=" + name + ", nickName=" + nickName + "]";
	}
}

java代码模拟按序插入，序号重复不能添加

public class linkedListDemo {
	public static void main(String[] args) {
		SingleLinkedList singleLinkedList = new SingleLinkedList();
		HeroNode hero1 = new HeroNode(1, "王二", "二狗");
		HeroNode hero2 = new HeroNode(2, "张三", "三胖");
		HeroNode hero3 = new HeroNode(3, "李四", "四块");
		HeroNode hero4 = new HeroNode(4, "刘五", "能能");
		singleLinkedList.addByOrder(hero3);
		singleLinkedList.addByOrder(hero1);
		singleLinkedList.addByOrder(hero4);
		singleLinkedList.addByOrder(hero2);
		singleLinkedList.show();
	}
}
class SingleLinkedList{
	private HeroNode head = new HeroNode(0, "", "");
	
	
	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;
		}
		//判断flag是否为true
		if(flag) {
			System.out.println("人物编号已经存在，不能添加");
		}else {
			heroNode.next = temp.next;
			temp.next=heroNode;
		}
		
	}
	public void show() {
		HeroNode temp = head.next;
		while(temp!=null) {
			System.out.println(temp);
			temp = temp.next;
		}
		
	}
}

class HeroNode{
	public int No;
	public String name;
	public String nickName;
	public HeroNode next;
	
	public HeroNode(int no, String name, String nickName) {
		super();
		No = no;
		this.name = name;
		this.nickName = nickName;
	}
	@Override
	public String toString() {
		return "heroNode [No=" + No + ", name=" + name + ", nickName=" + nickName + "]";
	}	
}

结果：

heroNode [No=1, name=王二, nickName=二狗]
heroNode [No=2, name=张三, nickName=三胖]
heroNode [No=3, name=李四, nickName=四块]
heroNode [No=4, name=刘五, nickName=能能]

 

修改功能代码

public void edit(HeroNode editHero) {
		HeroNode temp = head.next;
		boolean flag = false;
		
		while(true) {
			if(temp==null) {
				System.out.println("没有找到编号为"+editHero.No+"的人物");
				break;
			}
			if(temp.No==editHero.No) {
				flag = true;
				break;
			}		
			
				temp = temp.next;
			
		}
		if(flag) {
			temp.name=editHero.name;
			temp.nickName = editHero.nickName;
		}
	}

删除节点功能代码

public void delete(int no) {
		HeroNode temp = head;
		boolean flag = false;
		
		while(true) {
			if(temp.next==null) {
				System.out.println("没有找到相应人物，不能删除元素");
				break;
			}
			
			if(temp.next.No==no) {
				flag = true;
				break;
			}			
			else {
				temp = temp.next;
			}
		}
		if(flag) {
			temp.next = temp.next.next;
		}
	}