park.java

简单的停车场管理程序,运用了队列与栈来进行车辆存储与停车管理计费

package com.he.java;
import java.io.*;
import com.he.java.*;
public class Park
{
	public ListStack parkStack;
	public ListQueue rest;
	public ListStack midStack;
	public Park()
	{
		this.parkStack = new ListStack();
		this.rest = new ListQueue();
		this.midStack = new ListStack();
	}
	public void in(int id,int time)
	{
		car incar =new car(id, time);
		if(parkStack.getLength()<=10)
			parkStack.push(incar);
		else 
			rest.InQueue(incar);		
	}
	public void out(int id,int time)
	{
		car outcar =new car (id, time);
		while (((car)parkStack.top()).id != id)
		{	
			int newid=((car)parkStack.top()).id;			
			int newtime =	((car)parkStack.top()).time + 5;
			outcar = new car(newid,newtime);
			midStack..push(outcar);			
			parkStackpop();
			if (parkStack.isEmpty())
			{
				System.out.println( "停车场里没有"+ id+ "号这辆车!");
				break;
			}
		}
		if(!parkStack.isEmpty())
		{
			int money = (time- ((car)parkStack.top()).time-1)/30+1;
			System.out.println(" (parkStack.top()).element.time)"+ ((car)parkStack.top()).time+"");
			System.out.println(" (parkStack.top()).element.id)"+ ((car)parkStack.top()).id+"");
			if ((time- ((car)parkStack.top()).time)<=0)
				money = 0;			
			System.out.println(" 这是第"+id+"号车，总停车时间为"+(time- ((car)parkStack.top()).time)+"你应付"+money +"元");	
			parkStack.pop();
		}
		while(!midStack.isEmpty())
		{	
			int newid =((car)midStack.top()).id;
			int newtime = ((car)midStack.top()).time;
			car carnew =new car(newid,newtime);			
			parkStack.push(carnew);			
			midStack.pop();
			
		}
		
		if(parkStack.getLength()<10)
		{
			if (rest.getLength()!=0 )
			{
				int idnew =((car)rest.First()).id;
				rest.OutQueue();
				
				parkStack.push(new car(idnew,time));
				
			}
		
		}
		
		
	
		
		
		
	}

}