⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 test.java

📁 1. 定义链栈
💻 JAVA
字号:

class Test{
	public static void main(String[] args)
	{
		LinkStack MyLinkStack = new LinkStack();
		
 		MyLinkStack.push("1");
 		MyLinkStack.push("2");
 		MyLinkStack.push("3");
 		MyLinkStack.push("4");
 		MyLinkStack.push("5");
 		MyLinkStack.push("6");
 		System.out.println("The stack is : ");
 		MyLinkStack.display();
 		
 		System.out.println("The top of stack is : "+ MyLinkStack.top());
 		System.out.println("The length of tke stack is : "+MyLinkStack.size());
 		
 		System.out.println("After outing two numbers : ");
 		MyLinkStack.pop();
 		MyLinkStack.pop();
 		MyLinkStack.display();
 		
 		if(MyLinkStack.isEmpty())      
			System.out.println("The stack is empty!");
		else
			System.out.println("The stack is not empty!");
	
		System.out.println("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ");
		SequenceQueue MySequenceQueue = new SequenceQueue(5);
 		MySequenceQueue.enqueue("1");
 		MySequenceQueue.enqueue("2");
 		MySequenceQueue.enqueue("3");
 		MySequenceQueue.enqueue("4");
 		MySequenceQueue.enqueue("5");
 		MySequenceQueue.enqueue("6");
 		System.out.println("The queue is : ");
 		MySequenceQueue.display();
 		
 		try
 		{
 			MySequenceQueue.dequeue();
 			MySequenceQueue.dequeue();
 		}
 		catch(EmptyQueueException e)
 		{
 			
 		}
 		
 		System.out.println("After outing two numbers : ");
 		MySequenceQueue.display();
	}
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -