package Ele;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import java.util.Random;

public class Elevator {
  private List<Integer> upFloorList = new ArrayList<Integer>();    // 上升樓層
  private List<Integer> downFloorList = new ArrayList<Integer>();   // 下降樓層
  private int[] storeyWeight; // 目標(biāo)層重量
  private int capacity;    // 電梯最大重量
  private int topFloor;    // 電梯最高層
  private int bottomFloor;  // 電梯最底層
  private int nowFloor = 1;  // 當(dāng)前層

  public Elevator(int bottomFloor, int topFloor, int capacity) { //有參構(gòu)造方法
    this.topFloor = topFloor;
    this.bottomFloor = bottomFloor;
    this.capacity = capacity;

    // 當(dāng)前樓層減最低層，就是當(dāng)前層重量的下標(biāo) 假如當(dāng)前樓層為5樓，5樓下標(biāo)就是 5-1 = 4
    // 初始化目標(biāo)樓層重量，數(shù)組大小 = 最高層 - 最低層 + 1
    storeyWeight = new int[(topFloor - bottomFloor + 1)];
  }

  // 設(shè)置樓層
  public void SetFloor(int floorNum) {
    //如果 所選樓層 與 所在樓層 相同，則提示
    if (floorNum == nowFloor) {
      System.out.println("請(qǐng)選擇其它樓層");
      return;
    }

    // 生成90-500之間的隨機(jī)重量
    Random random = new Random();
    int thisFloorWeight = random.nextInt(500 - 90 + 1) + 90;

    int sum = 0;
    //目標(biāo)樓層增加的重量
    for (int i = 0; i < storeyWeight.length; i++) {
      sum += storeyWeight[i];
    }
    //原重量+增加重量=當(dāng)前重量
    System.out.println(floorNum + "層上來(lái)重量：" + thisFloorWeight + ",此時(shí)總重：" + (sum + thisFloorWeight));

    // 如果 目標(biāo)樓層總重量 > 最大重量，提示
    if (sum + thisFloorWeight > this.capacity) {
      System.out.println("超重了喲");
      return;
    }

    // 當(dāng)前輸入樓層重量加上該樓層新增加重量 后的重量
    storeyWeight[floorNum - bottomFloor] += thisFloorWeight;

    //如果輸入樓層數(shù) 已經(jīng)在上升或下降樓層的集合中，則只新增重量，不添加樓層
    if (!upFloorList.contains(floorNum) && !downFloorList.contains(floorNum)) {
      if (floorNum > nowFloor) {
        upFloorList.add(floorNum);

        // 上升樓層升序排序
        Collections.sort(upFloorList);

      } else {
        downFloorList.add(floorNum);

        // 下降樓層降序排序
        downFloorList.sort(Collections.reverseOrder());
      }
    }
  }

  // 上升：從所在層到所選樓層中的最高層
  // 下降：從所在層到所選樓層中的最低層
  // 獲得集合中最后一個(gè)元素：list.get(list.size()-1);

  // 啟動(dòng)電梯
  public void StartElevator() throws InterruptedException {
    System.out.println("當(dāng)前第 < " + nowFloor + " > 層");
    // 上行
    if (upFloorList.size() > 0) {
      System.out.println("---電梯上行---");
      for (int i = nowFloor + 1; i <= upFloorList.get(upFloorList.size() - 1); i++) {
        Thread.sleep(500);
        System.out.println("---第" + i + "層---");
        if (upFloorList.contains(i)) {
          System.out.println(" ☆開門☆");
          nowFloor = i;
          upFloorList.remove(upFloorList.indexOf(i));
          storeyWeight[i - bottomFloor] = 0;

          if (upFloorList.size() > 0) {
            System.out.println("剩余所選層數(shù)為：");
            Iterator it = upFloorList.iterator();
            while (it.hasNext()) {
              int floor = (int) it.next();
              System.out.print(floor + "層 重量：" + storeyWeight[floor - bottomFloor] + " ");
            }
            System.out.println();
          }
          return;
        }
      }
    }

    // 下行
    if (downFloorList.size() > 0) {
      System.out.println("---電梯下行---");
      for (int i = nowFloor - 1; i >= bottomFloor; i--) {
        Thread.sleep(500);
        System.out.println("---第" + i + "層---");
        if (downFloorList.contains(i)) {
          System.out.println(" ☆開門☆");
          nowFloor = i;
          downFloorList.remove(downFloorList.indexOf(i));
          storeyWeight[i - bottomFloor] = 0;
          if (downFloorList.size() > 0) {
            System.out.println("剩余所選層數(shù)為：");
            Iterator it = downFloorList.iterator();
            while (it.hasNext()) {
              int floor = (int) it.next();
              System.out.print(floor + "層 重量：" + storeyWeight[floor - bottomFloor] + " ");
            }
            System.out.println();
          }
          return;
        }
      }
    }
    System.out.println("無(wú)客");

  }
}

package com.company;


import Ele.Elevator;

import java.util.Scanner;

public class Main {

  public static void main(String[] args) throws InterruptedException {
    // 創(chuàng)建一個(gè)電梯
    int bottomFloor = 1;  // 最低層1樓
    int topFloor = 12;   // 最高層12樓
    int capacity = 1000;  // 最大承重1000
    Elevator elvator = new Elevator(bottomFloor, topFloor, capacity);

    System.out.println("當(dāng)前電梯可選擇" + bottomFloor + "-" + topFloor + "層，請(qǐng)選擇樓層數(shù)（輸入-1表示關(guān)閉電梯門）：");

    //輸入內(nèi)容
    Scanner scanner = new Scanner(System.in);
    while (scanner.hasNextLine()) {
      //如果輸入不是數(shù)字，提示后，再次輸入
      if (!scanner.hasNextInt()) {
        System.out.println("請(qǐng)輸入數(shù)字！");
        scanner.next();
      }

      //輸入是數(shù)字則進(jìn)行以下操作
      else {
        int num = scanner.nextInt();
        //若輸入數(shù)字為-1，意為結(jié)束輸入，啟動(dòng)電梯
        if (num == -1) {
          System.out.println("------------------------");
          System.out.println("電梯門關(guān)閉，開始啟動(dòng)");
          elvator.StartElevator();
        } else if (num > topFloor || num < bottomFloor || num == 0) {
          //若輸入數(shù)字不符合樓層數(shù)，則提示并再次輸入
          System.out.println("請(qǐng)選擇1-12樓層。");
        } else {
          elvator.SetFloor(num);
        }
      }
    }
  }
}

 if (!scanner.hasNextInt()) {
        System.out.println("請(qǐng)輸入數(shù)字！");
        scanner.next();
      }

if (!upFloorList.contains(floorNum) && !downFloorList.contains(floorNum)) {
      if (floorNum > nowFloor) {
        upFloorList.add(floorNum);

        // 上升樓層升序排序
        Collections.sort(upFloorList);

      } else {
        downFloorList.add(floorNum);

        // 下降樓層降序排序
        downFloorList.sort(Collections.reverseOrder());
      }
    }
  }