实现电梯系统

用Java实现电梯系统

标题如果输入的层数既有比当前楼层低又有比当前楼层高的话就进行先上升后下降,以下是运行的结果。
图片: 在这里插入图片描述

插入一段漂亮的代码片



import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Lifter extends Thread{
	//程序入口
	public static void main (String args[]) throws InterruptedException {
		Lifter lifter = new Lifter();
		lifter.go();
	}
	int flag=0;//0代表之只上升或者只下降反之.....
	int currentFloor=1;//当前楼层
	List <Integer> list=new ArrayList<Integer>();//目标楼层
	private void go() throws InterruptedException {
		flag=0;
		Scanner sc = new Scanner(System.in);
		// TODO Auto-generated method stub
		System.out.println("请输入楼层数");
		list.clear();
		while(true) {
			int a=sc.nextInt();
			if(a>0) {
				list.add(a);
			}
			

			if(a<0) {
				break;
			}
		}
		
		
		int min = Collections.min(list);
		int max = Collections.max(list);
		
		if(currentFloor>=max) {
			
			goDown(list);
			
		}
		else if(currentFloor<=min) {
	
			goUp(list);
			
		}
		else {
			
			goMiddle(list);
			
		}
	}
	
	
	//先上升后下降
	private void goMiddle(List list ) throws InterruptedException {
		flag=1;
		
		//需要上升的楼层
		List <Integer> listUp=new ArrayList<Integer>();
		//需要下降的楼层
		List <Integer> listDown=new ArrayList<Integer>();
		// TODO Auto-generated method stub
		Collections.sort(list);//从小到大
		
//		listDown.add((Integer) list.get(0));
//		listUp.add((Integer) list.get(1));
//		System.out.println(listUp.size());
//		System.out.println(listDown.size());\
		int i=0;
		while(true) {
			
			System.out.println(currentFloor);
			if(currentFloor > (Integer)list.get(i)) {
				listDown.add((Integer)list.get(i));//把上升楼层写入集合
				
				
			}
			if(currentFloor<(Integer)list.get(i)){
				listUp.add((Integer)list.get(i));//把下降楼层写入集合
			
			}
				
			
			i++;
			
			if(i>=list.size()) {break;}
		}
		//电梯上升过程
		goUp(listUp);
		//电梯下降过程
		goDown(listDown);
		
		go();
	}
	
	
	//上升
	private void goUp(List list) throws InterruptedException {
		
		System.out.println("电梯上升");
		// TODO Auto-generated method stub
		Collections.sort(list);//从小到大
		int i=0;
		while(true) {
			//模拟延时
			for(int j=0;j<(int)list.get(i)-currentFloor;j++) {
				Thread.sleep(500);//线程休眠0.5s
				System.out.println("......");
			}
			
			System.out.println("到达第"+list.get(i)+"层");
			//重置当前楼层数
			currentFloor =(int) list.get(i);
			i++;
			
			if(i>=list.size()) {break;}
			
		}
		System.out.println("当前在"+currentFloor+"层");
		
		if(flag==0){
			go();
		}
	}
	
	
	
	//下降
	private void goDown(List list) throws InterruptedException {
		System.out.println("电梯下降");
		// TODO Auto-generated method stub
		Collections.sort(list);//从小到大
		int i=list.size()-1;
		while(true) {
			//模拟延时
			for (int j=0;j<currentFloor-(int)list.get(i);j++) {
				Thread.sleep(500);//线程休眠0.5s
				System.out.println("......");
			}
			
			System.out.println("到达第"+list.get(i)+"层");
			//重置当前楼层数
			currentFloor =(int) list.get(i);
			i--;
			
			if(i<0) {break;}
		}
		System.out.println("当前在"+currentFloor+"层");
		if(flag==0){
			go();
		}
		
	}

}


C++源代码 注重类的交互 片段 #include using namespace std; #include "elevator.h" //Elevator class definition #include "person.h" //Person class definition #include "floor.h" //Floor class definition //constants that represent time required to travel //between floors and direction of the elevator const int Elevator::ELEVATOR_TRAVEL_TIME = 5; const int Elevator::UP = 0; const int Elevator::DOWN = 1; //constructor Elevator::Elevator( Floor &firstFloor, Floor &secondFloor) : elevatorButton( * this ), currentBuildingClockTime( 0 ), moving( false ), direction( UP ), currentFloor( Floor::FLOOR1 ), arrivalTime( 0 ), floor1NeedsService( false ), floor2NeedsService( false ), floor1Ref( firstFloor ), floor2Ref( secondFloor ), passengerPtr( 0 ) { cout << "elevator constrcuted" <<endl; }// end Elevator constructor //destructor Elevator::~Elevator() { delete passengerPtr; cout << "elevator destructed" << endl; }//end Elevator destructor //give time to elevator void Elevator::processTime( int time ) { currentBuildingClockTime = time; if ( moving ) //elevator is moving processPossibleArrival(); else processPossibleDeparture(); if ( !moving ) cout << "elevator at rest on floor " << currentFloor << endl; }// end function processTime // when elevator is moving, determine if it should stop void Elevator::processPossibleArrival() { //if elevator arrives at destination floor if ( currentBuildingClockTime == arrivalTime ) { currentFloor = ( currentFloor == Floor::FLOOR1 ? Floor::FLOOR2 : Floor::FLOOR1); //update current floor direction = ( currentFloor == Floor::FLOOR1 ? UP : DOWN ); //update direction cout << "elevator arrives on floor " << currentFloor <<endl; // process arrival at currentFloor arriveAtFloor( currentFloor == Floor::FLOOR1 ? floor1Ref : floor2Ref); return; }//end if //elevator still moving cout << "elevator moving " << ( direction == UP ? "UP" : "DOWN"
评论 5
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值