Super Simple Python AC w/ Remapping
Treat the first N - |B| numbers as those we can pick from. Iterate through the blacklisted numbers and map each of them to to one of the remaining non-blacklist
Treat the first N - |B| numbers as those we can pick from. Iterate through the blacklisted numbers and map each of them to to one of the remaining non-blacklisted |B| numbers\n\nFor picking, just pick a random uniform int in 0, N - |B|. If its not blacklisted, return the number. If it is, return the number that its mapped to\n```\nimport random\n\nclass Solution:\n    def __init__(self, N, blacklist):\n        blacklist = sorted(blacklist)\n        self.b = set(blacklist)\n        self.m = {}\n        self.length = N - len(blacklist)\n        j = 0\n        for i in range(self.length, N):\n            if i not in self.b:\n                self.m[blacklist[j]] = i\n                j += 1\n\n    def pick(self):\n        i = random.randint(0, self.length - 1)\n        return self.m[i] if i in self.m else i\n```
[]