LeetCode 379: Design Phone Directory
Problem Restatement We need to design a phone directory. The directory starts with maxNumbers available numbers: 0, 1, 2, ..., maxNumbers - 1 We need to support three operations: Operation Meaning get() Return an available number and mark it as used check(number) Return whether number is available release(number) Make a used number available again If no number is available, get() must return -1 . The problem statement defines these operations...