Design a Phone Directory which supports the following operations:
get
: Provide a number which is not assigned to anyone.check
: Check if a number is available or not.release
: Recycle or release a number.
Example:
// Init a phone directory containing a total of 3 numbers: 0, 1, and 2. PhoneDirectory directory = new PhoneDirectory(3); // It can return any available phone number. Here we assume it returns 0. directory.get(); // Assume it returns 1. directory.get(); // The number 2 is available, so return true. directory.check(2); // It returns 2, the only number that is left. directory.get(); // The number 2 is no longer available, so return false. directory.check(2); // Release number 2 back to the pool. directory.release(2); // Number 2 is available again, return true. directory.check(2);
思路:用queue和hashset,刚开始我还想为什么这题是划分在LinkedList的类别中,很是奇怪,其实这题用array也可以做。看了答案,我觉得这题出的不是很严谨,因为说可以返回任意点的available number,那么中间还要有个random函数才行。这题答案,竟然用queue,虽然可以达到O(1)的操作,但是不是random的。无所谓了,这题也许只是考查怎么设计才能使得速度提高到O(1),所有的速度都是O(1);
public class PhoneDirectory {
/** Initialize your data structure here
@param maxNumbers - The maximum numbers that can be stored in the phone directory. */
private int maxNumbers;
private HashSet<Integer> signout;
private Queue<Integer> queue;
public PhoneDirectory(int maxNumbers) {
this.maxNumbers = maxNumbers;
signout= new HashSet<Integer>();
queue = new LinkedList<Integer>();
for(int i=0; i<maxNumbers; i++) {
queue.offer(i);
}
}
/** Provide a number which is not assigned to anyone.
@return - Return an available number. Return -1 if none is available. */
public int get() {
Integer num = queue.poll();
if(num == null) {
return -1;
}
signout.add(num);
return num;
}
/** Check if a number is available or not. */
public boolean check(int number) {
if(number<0 || number>=this.maxNumbers){
return false;
}
return !signout.contains(number);
}
/** Recycle or release a number. */
public void release(int number) {
if(check(number)) return;
queue.offer(number);
signout.remove(number);
}
}
/**
* 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);
*/