elevator design example

转自:http://careercup.com/question?id=5698327039442944


repose with format corrected*

public class Elevator {
	
	public static final int MAX_FLOORS = 50;
	
	// upward floor queue
	private PriorityQueue<Integer> floors_up = new PriorityQueue<Integer>(MAX_FLOORS);
	
	// downward floor queue
	private PriorityQueue<Integer> floors_down = new PriorityQueue<Integer>(MAX_FLOORS, new Comparator<Integer>(){
		public int compare(Integer arg0, Integer arg1) {
			return arg1.compareTo(arg0);
		}
	});
	
	// effective floor queue
	private PriorityQueue<Integer> floors = floors_up;
	
	// current floor
	private int current = 0;

	public void userCallAt(int where) {
		setTarget(where);
	}
	
	public void setTarget(int target) {
		
		// ignore if target is current
		if (target == current) {
			return;
		}
		
		// add target to right queue
		if (floors == floors_up) {
			if (target < current) {
				floors_down.offer(target);
			} else {
				floors_up.offer(target);
			}
		} else {
			if (target > current) {
				floors_up.offer(target);
			} else {
				floors_down.offer(target);
			}
		}
		
		// swap queue to turn around the elevator
		if (floors.isEmpty()) {
			floors = (floors == floors_up ? floors_down : floors_up);
		}
	}
	
	public int getTarget() {
		
		if (!floors.isEmpty()) {
			return floors.peek();
		}
		
		if (floors_up.isEmpty() && floors_down.isEmpty()) {
			return current;
		}
		
		floors = (floors == floors_up ? floors_down : floors_up);
		return floors.peek();
	}
	
	public int getCurrent() {
		return current;
	}
	
	public void step(int target) {
		if (target > current) {
			current++;
		} else {
			current--;
		}
	}
	
	public void stop() {
		floors.poll();
	}
	
	public void move() {
		
		while (getCurrent() != getTarget()) {
			do {
				step(getTarget());
			} while (getCurrent() != getTarget());
			stop();
		}
		
	}
	
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值