采用投票法,也叫同归于尽法。代码参考于B站UP主大红豆小薏米【LeetCode训练营】(摩尔投票法)169. Majority Element_哔哩哔哩_bilibili,讲的很好很清楚。
# Boyer-Moore 投票算法
def majorityElement(self, nums: list[int]) -> int:
count = 0
candidate = None
for i in nums:
if i == candidate:
count += 1
elif count > 0:
count -= 1
else:
candidate, count = i, 1
return candidate
if __name__ == "__main__":
list1 = list(eval(input('请输入测试用例,各元素之间用逗号隔开:'))) # eval()将字符串还原为数字类型,参数直接用‘,‘分开
print('寻找到的多数元素为:', end='')
candidate = majorityElement(list1, nums=list1)
print(candidate)
测试用例: