Fetch the repository succeeded.
# Time: O(1.189), counted by statistics, limit would be O(log10/log7) = O(1.183)
# Space: O(1)
import random
def rand7():
return random.randint(1, 7)
# Reference: https://leetcode.com/problems/implement-rand10-using-rand7/discuss/151567/C++JavaPython-Average-1.199-Call-rand7-Per-rand10
class Solution(object):
def __init__(self):
self.__cache = []
def rand10(self):
"""
:rtype: int
"""
def generate(cache):
n = 32
curr = sum((rand7()-1) * (7**i) for i in xrange(n))
rang = 7**n
while curr < rang//10*10:
cache.append(curr%10+1)
curr /= 10
rang /= 10
while not self.__cache:
generate(self.__cache)
return self.__cache.pop()
# Time: O(2 * (1 + (9/49) + (9/49)^2 + ...)) = O(2/(1-(9/49)) = O(2.45)
# Space: O(1)
class Solution2(object):
def rand10(self):
"""
:rtype: int
"""
while True:
x = (rand7()-1)*7 + (rand7()-1)
if x < 40:
return x%10 + 1
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。