zoukankan      html  css  js  c++  java
  • 1603. Design Parking System

    Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.

    Implement the ParkingSystem class:

    • ParkingSystem(int big, int medium, int small) Initializes object of the ParkingSystem class. The number of slots for each parking space are given as part of the constructor.
    • bool addCar(int carType) Checks whether there is a parking space of carType for the car that wants to get into the parking lot. carType can be of three kinds: big, medium, or small, which are represented by 12, and 3 respectively. A car can only park in a parking space of its carType. If there is no space available, return false, else park the car in that size space and return true.

    Example 1:

    Input
    ["ParkingSystem", "addCar", "addCar", "addCar", "addCar"]
    [[1, 1, 0], [1], [2], [3], [1]]
    Output
    [null, true, true, false, false]
    
    Explanation
    ParkingSystem parkingSystem = new ParkingSystem(1, 1, 0);
    parkingSystem.addCar(1); // return true because there is 1 available slot for a big car
    parkingSystem.addCar(2); // return true because there is 1 available slot for a medium car
    parkingSystem.addCar(3); // return false because there is no available slot for a small car
    parkingSystem.addCar(1); // return false because there is no available slot for a big car. It is already occupied.
    

    Constraints:

    • 0 <= big, medium, small <= 1000
    • carType is 12, or 3
    • At most 1000 calls will be made to addCar
    class ParkingSystem {
        Map<Integer, Integer> map;
        public ParkingSystem(int big, int medium, int small) {
            map = new HashMap();
            map.put(1, big);
            map.put(2, medium);
            map.put(3, small);
        }
        
        public boolean addCar(int carType) {
            if(map.get(carType) > 0) {
                map.put(carType, map.get(carType) - 1);
                return true;
            }
            else return false;
        }
    }
    
    /**
     * Your ParkingSystem object will be instantiated and called as such:
     * ParkingSystem obj = new ParkingSystem(big, medium, small);
     * boolean param_1 = obj.addCar(carType);
     */

    hashmap

    class ParkingSystem {
        int[] arr;
        public ParkingSystem(int big, int medium, int small) {
            arr = new int[]{big, medium, small};
        }
        
        public boolean addCar(int carType) {
            if(arr[carType - 1] > 0) {
                arr[carType - 1]--;
                return true;
            }
            else return false;
        }
    }
  • 相关阅读:
    Spring通过springframework.data的@PageableDefault注解分页
    Specifications动态查询
    IDEA生成序列号serialVersionUID快捷键
    JS组件系列——表格组件神器:bootstrap table(还没细看)
    南昌网络赛 Distance on the tree(可持久化线段树)
    南昌网络赛 Max answer(单调栈)
    HDU 6148 Valley Numer(数位DP)
    python 二位dict
    Codeforces Round #230 (Div. 2) 题解
    Codeforces Round #228 (Div. 2) 题解
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13772313.html
Copyright © 2011-2022 走看看