單向鏈表(JAVA)

package com.wyj.linkedlist;

import java.util.Stack;

public class SingleLinkedListDemo {

	public static void main(String[] args) {
		//進行測試
		//先創建節點
		HeroNode heroNode1 = new HeroNode(1, "songjiang", "jishiwu");
		HeroNode heroNode2 = new HeroNode(2, "songjiang2", "jishiwu2");
		HeroNode heroNode3 = new HeroNode(3, "songjiang3", "jishiwu3");
		HeroNode heroNode4 = new HeroNode(4, "songjiang3", "jishiwu3");
		

		SingleLinkedList name = new SingleLinkedList();
		/*
		 * name.add(heroNode1); name.add(heroNode2); name.add(heroNode3);
		 */
		name.addByOrder(heroNode1);
		name.addByOrder(heroNode3);
		name.addByOrder(heroNode2);
		name.addByOrder(heroNode4);
		name.list();
		
		//name.deleteNo(3);
		/*
		 * HeroNode heroNode5 = new HeroNode(4, "兒子", "jishiwu2");
		 * name.update(heroNode5);
		 */
		//name.list();
		/*
		 * reversalList(name.getHead()); name.list();
		 * System.out.println(getLength(name.getHead()));
		 */
	}
	//獲取鏈表長度
	public static int getLength(HeroNode head) {
		if (head.next == null) {
			return 0;
		}
		int length = 0;
		HeroNode cur = head.next;
		while (cur!=null) {
			length++;
			cur = cur.next;
		}
		return length;
	}
	
	//新浪面試題:
	//求單鏈表從 後面數的k的位置
	public static HeroNode getK(HeroNode head,int index) {
		if(head.next == null) {
			return null;
		}
		HeroNode cur = head.next;
		int length = getLength(head);
		if (index <= 0||index > length ) {
			return null;
		}
		for (int i = 0; i < length - index ; i++) {
			cur = cur.next;
		}
		return cur;
	}
	
	//騰訊面試題：單鏈表的翻轉
	public static void reversalList(HeroNode head) {
		if (head.next == null || head.next.next == null) {
			return;
		}
		HeroNode cur = head.next;
		HeroNode next = null;
		HeroNode reverseHead = new HeroNode(0, "", "");
		while (cur != null) {
			next = cur.next;
			cur.next = reverseHead.next;
			reverseHead.next = cur;
			cur = next;
		}
		head.next = reverseHead.next;
		return;
	}
	//百度面試題，逆序打印大連表
	public static void reversePrint(HeroNode head) {
		if (head.next == null) {
			return;
		}
		Stack<HeroNode> stack = new Stack<HeroNode>();
		HeroNode cur = head.next;
		while (cur != null) {
			stack.push(cur);
			cur = cur.next;
		}
		while (stack.size() > 0) {
			System.out.println(stack.pop());
		}
	}
	
}

//定義 SingleLinkedList 管理我們的英雄
class SingleLinkedList{
	//先初始化一個頭結點
	private HeroNode head = new HeroNode(0, "", "");
	//添加節點到單向鏈表
	//找到最後節點，將信息添加到最後節點
	public HeroNode getHead() {
		return head;
	}
	public void setHead(HeroNode head) {
		this.head = head;
	}
	
	public void add(HeroNode heroNode) {
		//因爲head節點不能動，因此我們需要一個輔助遍歷temp
		HeroNode temp = head;
		while (true) {
			//找到鏈表最後一個元素
			if(temp.next == null) {
				break;
			}
			temp = temp.next;
			
		}
		temp.next = heroNode;
	}

	//顯示鏈表
	public void list() {
		if (head.next == null) {
			System.out.println("鏈表爲空！");
			return;
		}
		//因爲head節點不能動，因此我們需要一個輔助遍歷temp
		HeroNode temp = head.next;
		while (true) {
			System.out.println(temp);
			//找到鏈表最後一個元素
			if(temp.next == null) {
				break;
			}
			
			temp = temp.next;
		}
	}
	
	//修改節點的信息 ，根據no修改，即no不能修改
	public void update(HeroNode newHeroNode) {
		if (head.next == null) {
			System.out.println("鏈表爲空");
		}
		HeroNode temp = head.next;
		boolean flag = false;
		while (true) {
			if (temp == null) {
				break;
			}
			if (newHeroNode.no == temp.no) {
				flag = true;
				break;
			}
			temp = temp.next;
		}
		if (flag) {
			temp.name = newHeroNode.name;
			temp.nikename = newHeroNode.nikename;
		}else {
			System.out.println("沒有找到要修改的no");
		}
		
	}
	
	//刪除節點
	public void deleteNo(int no) {
		HeroNode temp = head;
		boolean flag = false;
		while (temp.next!=null) {
			if (temp.next.no == no) {
				temp.next = temp.next.next;
			}
			temp = temp.next;
		}
	}
	
	//按照順序添加
	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.printf("準備插入的%d英雄已經存在！",heroNode.no);
			System.out.println();
		}else {
			heroNode.next = temp.next;
			temp.next = heroNode;
		}
	}
	
}

//定義HeroNode，每個HeroNode 對象就是一個節點
class HeroNode{
	public int no;
	public String name;
	public String nikename;
	public HeroNode next;
	public HeroNode(int no, String name, String nikename) {
		super();
		this.no = no;
		this.name = name;
		this.nikename = nikename;
	}
	@Override
	public String toString() {
		return "HeroNode [no=" + no + ", name=" + name + ", nikename=" + nikename + ", getClass()="
				+ getClass() + ", hashCode()=" + hashCode() + ", toString()=" + super.toString() + "]";
	}
	
	
	
	
}