題目如下:
有了497的解題基礎,這道題還是比較好解,使用bisect.bisect_left()來通過權重對元素進行定位。參考代碼如下:
'''
@auther: Jedi.L
@Date: Wed, Feb 27, 2019 11:54
@Email: [email protected]
@Blog: www.tundrazone.com
'''
import random
import bisect
class Solution:
def __init__(self, w: List[int]):
self.w = w
self.sw = []
w_sum = 0
for ww in self.w:
w_sum += ww
self.sw.append(w_sum)
def pickIndex(self) -> int:
return bisect.bisect_left(
self.sw, random.randint(1, self.sw[-1]))
源碼地址:
https://github.com/jediL/LeetCodeByPython
其它題目:[leetcode題目答案講解彙總(Python版 持續更新)]
(https://www.jianshu.com/p/60b5241ca28e)
ps:如果您有好的建議,歡迎交流 :-D,
也歡迎訪問我的個人博客 苔原帶 (www.tundrazone.com)