LeetCode-Design Phone Directory

Design a Phone Directory which supports the following operations:

 

  1. get: Provide a number which is not assigned to anyone.
  2. check: Check if a number is available or not.
  3. 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);
 
 Analysis:
 
We record the last used number and also maintain a hashset to record all released number. Everytime get() called, we first get a released number, if not, then use an unused number.
 
Solution:
 1 public class PhoneDirectory {
 2     HashSet<Integer> numReleased;
 3     int maxNum, nextUnuse;
 4 
 5 
 6     /** Initialize your data structure here
 7         @param maxNumbers - The maximum numbers that can be stored in the phone directory. */
 8     public PhoneDirectory(int maxNumbers) {
 9         numReleased = new HashSet<Integer>();
10         maxNum = maxNumbers;
11         nextUnuse = 0;
12         
13     }
14     
15     /** Provide a number which is not assigned to anyone.
16         @return - Return an available number. Return -1 if none is available. */
17     public int get() {
18         int num = -1;
19         if (!numReleased.isEmpty()) {
20             for (Integer i : numReleased) {
21                 num = i;
22                 break;
23             }
24             numReleased.remove(num);
25         } else if (nextUnuse < maxNum) {
26             num = nextUnuse++;
27         }
28         return num;
29     }
30     
31     /** Check if a number is available or not. */
32     public boolean check(int number) {
33         if (number >= maxNum) return false;
34 
35         if (number >= nextUnuse || numReleased.contains(number)) return true;
36 
37         return false;
38     }
39     
40     /** Recycle or release a number. */
41     public void release(int number) {
42         if (number >= nextUnuse)  return;
43         numReleased.add(number);
44     }
45 }
46 
47 /**
48  * Your PhoneDirectory object will be instantiated and called as such:
49  * PhoneDirectory obj = new PhoneDirectory(maxNumbers);
50  * int param_1 = obj.get();
51  * boolean param_2 = obj.check(number);
52  * obj.release(number);
53  */

 

转载于:https://www.cnblogs.com/lishiblog/p/5748931.html

内容概要:本文系统介绍了算术优化算法(AOA)的基本原理、核心思想及Python实现方法,并通过图像分割的实际案例展示了其应用价值。AOA是一种基于种群的元启发式算法,其核心思想来源于四则运算,利用乘除运算进行全局勘探,加减运算进行局部开发,通过数学优化器加速函数(MOA)和数学优化概率(MOP)动态控制搜索过程,在全局探索与局部开发之间实现平衡。文章详细解析了算法的初始化、勘探与开发阶段的更新策略,并提供了完整的Python代码实现,结合Rastrigin函数进行测试验证。进一步地,以Flask框架搭建前后端分离系统,将AOA应用于图像分割任务,展示了其在实际工程中的可行性与高效性。最后,通过收敛速度、寻优精度等指标评估算法性能,并提出自适应参数调整、模型优化和并行计算等改进策略。; 适合人群:具备一定Python编程基础和优化算法基础知识的高校学生、科研人员及工程技术人员,尤其适合从事人工智能、图像处理、智能优化等领域的从业者;; 使用场景及目标:①理解元启发式算法的设计思想与实现机制;②掌握AOA在函数优化、图像分割等实际问题中的建模与求解方法;③学习如何将优化算法集成到Web系统中实现工程化应用;④为算法性能评估与改进提供实践参考; 阅读建议:建议读者结合代码逐行调试,深入理解算法流程中MOA与MOP的作用机制,尝试在不同测试函数上运行算法以观察性能差异,并可进一步扩展图像分割模块,引入更复杂的预处理或后处理技术以提升分割效果。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值