Java员工管理系统——链表

http://E:\学习\a宏智\JAVA基础\链表\公司员工管理系统

CompanyTest.java

public class CompanyTest {
	//测试员工链表类--add方法
	public static boolean testAdd(){
		//测试只添了一个员工
		EmpLinkedList link=new EmpLinkedList();
		Employee emp1=new Employee("张三", Dept.develop, 5000);
		link.add(emp1);
		String expectString="张三 ";
		String actulString=link.toString();
		if(!expectString.equals(actulString)){
			return false;
		}
		//测试同部多个员工
		Employee emp2=new Employee("李四", Dept.develop, 7000);
		link.add(emp2);
		expectString="李四 张三 ";
		actulString=link.toString();
		if(!expectString.equals(actulString)){
			return false;
		}
		//测试不同部门添加员工
		Employee emp3=new Employee("王五", Dept.manage, 6000);
		link.add(emp3);
		expectString="李四 张三 王五 ";
		actulString=link.toString();
		if(!expectString.equals(actulString)){
			return false;
		}
		//测试添加多个部门的员工
		Employee emp4=new Employee("赵六", Dept.manage, 5800);
		Employee emp5=new Employee("赵七", Dept.markert, 6800);
		link.add(emp4);
		link.add(emp5);
		

		expectString="李四 张三 赵六 王五 赵七 ";
		
		actulString=link.toString();
		//System.out.println(actulString);
		if(!expectString.equals(actulString)){
			return false;
		}
		
		return true;
	}
	
	//测试部门人数的方法
	public void testGetCount(){
		
	}
	public static void main(String[] args) {
		System.out.println("测试员工链表--入职方法: "
		        + (testAdd() ? "通过" : "失败!"));
	
	}

}

Test.java

public class Test {
	public static void main(String[] args) {
		EmpLinkedList link=new EmpLinkedList();
		Employee emp1=new Employee("张三", Dept.develop, 5000);
		Employee emp2=new Employee("李四", Dept.develop, 7000);
		Employee emp3=new Employee("王五", Dept.manage, 6000);
		Employee emp4=new Employee("赵六", Dept.manage, 5800);
		Employee emp5=new Employee("赵七", Dept.markert, 6800);
		EmpNode node1=new EmpNode(emp1);
		EmpNode node2=new EmpNode(emp2);
		EmpNode node3=new EmpNode(emp3);		
		link.add(emp1);
		link.travle();
		System.out.println();
		link.add(emp2);
		link.travle();
		System.out.println();
		link.add(emp3);
		link.travle();
		System.out.println();
		link.add(emp4);
		link.travle();
		System.out.println();
		

		link.add(emp5);
		link.travle();
		System.out.println();
		
		TreeNode root= new TreeNode(link.head.getEmp());
		SortTree st=new SortTree(link, root);
		
		st.convertSortTree(link);

		System.out.println("\n删除中间部份");
		link.removeDept(Dept.manage);
		link.travle();
		System.out.println();
		
		System.out.println("删除前面部份");
		link.removeDept(Dept.develop);
		link.travle();
		System.out.println();

		System.out.println("删除全部");
		link.removeDept(Dept.markert);
		link.travle();
		System.out.println();
	
	}

}