剑指offer-数组中出现次数超过一半的数字之python实现

最新推荐文章于 2022-02-05 10:34:58 发布

原创最新推荐文章于 2022-02-05 10:34:58 发布 · 149 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

13 篇文章

订阅专栏

该博客主要围绕剑指offer中数组里出现次数过半数字的问题，用Python语言进行实现，聚焦于信息技术领域的算法实现，为相关问题解决提供思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class Solution:
    def MoreThanHalfNum_Solution(self, numbers):
        left, right = 0, len(numbers) - 1
        index = self.helper(numbers, left, right)
        mid = int(len(numbers) / 2)

        while index != mid:
            if index > mid:
                right = index - 1
                index = self.helper(numbers, left, right)
            elif index < mid:
                left = index + 1
                index = self.helper(numbers, left + 1, right)
        if self.checkMoreThanHalf(numbers, numbers[index]):
            return numbers[index]
        return 0  
        
    def helper(self, numbers,left, right):
        base = numbers[left]
        while left < right:
            while left < right and numbers[right] >= base:
                right -= 1
            numbers[left] = numbers[right]
            while left < right and numbers[left] <= base:
                left += 1
            numbers[right] = numbers[left]
        numbers[left] = base
        return left
    def checkMoreThanHalf(self, numbers, res):
        count = 0
        for i in range(len(numbers)):
            if numbers[i] == res:
                count += 1
        if count > int(len(numbers) / 2):
            return True
        return  False