39：数组中出现次数超过一半的数字（剑指offer第2版Python）

1、题目描述

数组中有一个数字出现的次数超过数组长度的一半，请找出这个数字。例如输入一个长度为9的数组{1,2,3,2,2,2,5,4,2}。由于数字2在数组中出现了5次，超过数组长度的一半，因此输出2。如果不存在则输出0。

 

2、代码详解

书上第二种思路：根据数组特点的O(n)算法

# -*- coding:utf-8 -*-
class Solution:
    def MoreThanHalfNum_Solution(self, numbers):
        if len(numbers) == 0:
            return 0
        if len(numbers) == 1:
            return numbers[0]
        num = numbers[0]
        count = 1
        # 计数法
        for i in range(1, len(numbers)):
            if count == 0:
                num = numbers[i]
                count = 1
            elif numbers[i] == num:
                count += 1
            else:
                count -= 1
            # print(numbers[i], count)
        print("num:", num, ",count:", count)
        # 验证最多的数，是否满足超过长度一半
        times = 0
        for i in range(len(numbers)):
            if numbers[i] == num:
                times += 1
        if times > len(numbers)/2:
            return num
        else:
            return 0

S = Solution()
print(S.MoreThanHalfNum_Solution([1, 2, 3, 2, 2, 2, 5, 4, 2]))
print(S.MoreThanHalfNum_Solution([1, 2, 3, 3, 3, 3, 4]))
print(S.MoreThanHalfNum_Solution([1, 2]))

基于Partition函数的O(n)算法（有时间再补充）

python调用sort思路，出现次数超过一半的数字，不管如何，必然这个数字位于数组中间的位置，因此可以采用类似于快排的划分的方法，找到位于数组中间的位置的数字，然后在顺序检索是否这个数字出现次数超过一半。

# -*- coding:utf-8 -*-
class Solution:
    """对列表排序，计算下标为len/2(即中间位置)的数字数量即可"""
    def MoreThanHalfNum_Solution(self, numbers):
        # write code here
        numbers.sort()
        median = numbers[len(numbers)/2]
        if numbers.count(median) > len(numbers)/2:
            return median
        return  0

其他参考答案

# -*- coding:utf-8 -*-
class Solution:
    """第一种，用python的标准库collections"""
    def MoreThanHalfNum_Solution(self, numbers):
        # write code here
        from collections import Counter
        count =  Counter(numbers).most_common()
        if count[0][1] > len(numbers)/2.0:
            return count[0][0]
        return 0
 
class Solution:
    """第二种，假设有这个数字，那么它的数量一定比其它所有数字之和还要多，按照这个思路得出num，然后验证
    """
    def MoreThanHalfNum_Solution(self, numbers):
        # write code here
        if not numbers:
            return 0
        num = numbers[0]
        count = 1
        for i in range(1, len(numbers)):
            if numbers[i] == num:
                count += 1
            else:
                count -= 1
            if count == 0:
                num = numbers[i]
                count = 1
        count = 0
        for i in numbers:
            if i == num:
                count += 1
        return num if count > len(numbers) / 2.0 else 0
 
class Solution:
    """对列表排序，计算下标为len/2(即中间位置)的数字数量即可"""
    def MoreThanHalfNum_Solution(self, numbers):
        # write code here
        # 对列表进行快排
        left = 0
        right = len(numbers) - 1
        stack = [right, left]
        while stack:
            low = stack.pop()
            high = stack.pop()
            if low >= high:
                continue
            less = low - 1
            mid = numbers[high]
            for i in range(low, high):
                if numbers[i] <= mid:
                    less += 1
                    numbers[less], numbers[i] = numbers[i], numbers[less]
            numbers[less + 1], numbers[high] = numbers[high], numbers[less + 1]
            stack.extend([high, less+2, less, low])
        # 验证
        count = 0
        length = len(numbers) // 2
        for i in numbers:
            if i == numbers[length // 2]:
                count += 1
        return numbers[length // 2] if count > length / 2.0 else 0