Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
design-phone-directory.cpp 1.65 KB
一键复制 编辑 原始数据 按行查看 历史
kamyu 提交于 2016-08-03 22:14 +08:00 . Update design-phone-directory.cpp
// 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);
*/
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助