Solution URL
https://leetcode-cn.com/submissions/detail/120268480/
代码
class PhoneDirectory {
//https://leetcode-cn.com/problems/design-phone-directory/solution/379-dian-hua-mu-lu-guan-li-xi-tong-by-klb/
private boolean[] phone;
private int size;
/** Initialize your data structure here
@param maxNumbers - The maximum numbers that can be stored in the phone directory. */
public PhoneDirectory(int maxNumbers) {
this.size = maxNumbers;
phone = new boolean[size];
//set all phone array true
Arrays.fill(phone, true);
}
/** Provide a number which is not assigned to anyone.
@return - Return an available number. Return -1 if none is available. */
public int get() {
for(int i = 0; i < size; i++){
if(phone[i]){
phone[i] = false;
return i;
}
}
return -1;
}
/** Check if a number is available or not. */
public boolean check(int number) {
return phone[number];
}
/** Recycle or release a number. */
public void release(int number) {
phone[number] = true;
}
}
/**
* Your PhoneDirectory object will be instantiated and called as such:
* PhoneDirectory obj = new PhoneDirectory(maxNumbers);
* int param_1 = obj.get();
* boolean param_2 = obj.check(number);
* obj.release(number);
*/
