LeetCode_1603_设计停车系统

题目链接

• https://leetcode-cn.com/problems/design-parking-system/

解题思路

• 利用一个整数数组来模拟停车位，每个类型对应数组的一个位置。
• 停车就是判断当前类型车辆是否有余位(>0)，每次停车相应的停车位-1

AC代码

class ParkingSystem {

    int[] carContainer = new int[3];//停车场容量只有大中小三中车型

    public ParkingSystem(int big, int medium, int small) {
        carContainer[0] = big;
        carContainer[1] = medium;
        carContainer[2] = small;
    }

    public boolean addCar(int carType) {
        if (carContainer[carType - 1] > 0) {
            carContainer[carType - 1]--;
            return true;
        }
        return false;
    }
}

本地测试代码

package com.company;

//题目链接：https://leetcode-cn.com/problems/design-parking-system/
public class ParkingSystem {
    int[] carContainer = new int[3];//停车场容量只有大中小三中车型

    public ParkingSystem(int big, int medium, int small) {
        carContainer[0] = big;
        carContainer[1] = medium;
        carContainer[2] = small;
    }

    public boolean addCar(int carType) {
        if (carContainer[carType - 1] > 0) {
            carContainer[carType - 1]--;
            return true;
        }
        return false;
    }

    public static void main(String[] args) {
        ParkingSystem parkingSystem = new ParkingSystem(1, 1, 0);
        System.out.println(parkingSystem.addCar(1));
        System.out.println(parkingSystem.addCar(2));
        System.out.println(parkingSystem.addCar(3));
        System.out.println(parkingSystem.addCar(1));
    }
}