代码拉取完成,页面将自动刷新
// init: Time: O(n), Space: O(n)
// get: Time: O(1), Space: O(1)
// check: Time: O(1), Space: O(1)
// release: Time: O(1), Space: O(1)
class PhoneDirectory {
public:
/** Initialize your data structure here
@param maxNumbers - The maximum numbers that can be stored in the phone directory. */
PhoneDirectory(int maxNumbers) :
curr_{0}, numbers_(maxNumbers), used_(maxNumbers) { // Time: O(n), Space: O(n)
iota(numbers_.begin(), numbers_.end(), 0);
}
/** Provide a number which is not assigned to anyone.
@return - Return an available number. Return -1 if none is available. */
int get() { // Time: O(1), Space: O(1)
if (curr_ == numbers_.size()) {
return -1;
}
const auto number = numbers_[curr_++];
used_[number] = true;
return number;
}
/** Check if a number is available or not. */
bool check(int number) { // Time: O(1), Space: O(1)
if (number < 0 || number >= numbers_.size()) {
return false;
}
return !used_[number];
}
/** Recycle or release a number. */
void release(int number) { // Time: O(1), Space: O(1)
if (number < 0 || number >= numbers_.size() || !used_[number]) {
return;
}
used_[number] = false;
numbers_[--curr_] = number ;
}
private:
int curr_;
vector<int> numbers_;
vector<bool> used_;
};
/**
* Your PhoneDirectory object will be instantiated and called as such:
* PhoneDirectory obj = new PhoneDirectory(maxNumbers);
* int param_1 = obj.get();
* bool param_2 = obj.check(number);
* obj.release(number);
*/
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。