Day28:数组中出现次数超过一半的数字

public class Solution{
	public int MoreThanHalfNum_Solution(int [] array){
		int len = array.length;
		int k = array[0];
		int count = 1;
		for(int i = 1; i < len; i++){
			if(k == array[i]){
				count++;
			}
			else if(k != array[i]){
				count--;
			}if(count == 0){
				k = array[i];
				count = 1;
			}
		}
		int num = 0;
		for(int j = 0; j < len; j++){
			if(array[j] == k){
				num++;
			}
		}
		if(num * 2 <= len){
			return 0;
		}else{
			return k;
		}
	}
}

public class Solution{
	public int MoreThanHalfNum_Solution(int []array){
		if(array == null || array.length == 0){
			return 0;
		}
		int most = array[0];
		int count = 1;
		for(int i = 1; i < array.length; i++){
			count = most == array[i]?count+1:count-1;
			if(count == 0){
				most = array[i];
				count = 1;
			}
		}
		count = 0;
		for(int i = 0; i < array.length;i++){
			if(most == array[i]){
			count++;
			}
		}
			return count > array.length/2?most:0;
	}
}

class Solution:
	def MoreThanHalfNum_Solution(self, numbers):
		if numbers == []:
			return 0
		dictonary = {}
		dictonary = dictonary.fromkeys(numbers, 0)
		for num in numbers:
			dictonary[num] += 1
		for key in dictonary.keys():
			if dictonary[key] * 2 > len(numbers):
				return key
		return 0

class Solution:
    def partitionOfK(self, numbers, start, end, k):
        if k < 0 or numbers == [] or start < 0 or end >= len(numbers) or k > end:
            return None
        low = start
        high = end
        key = numbers[start]
        while low < high:
            while low < high and numbers[high] >= key:
                high -= 1
            numbers[low] = numbers[high]
            while low < high and numbers[low] <= key:
                low += 1
            numbers[high] = numbers[low]
        numbers[low] = key
        if low < k:
            return self.partitionOfK(numbers, start + 1, end, k)
        elif low > k:
            return self.partitionOfK(numbers, start, end - 1, k)
        else:
            return numbers[low]
    def checkMoreThanHalf(self, numbers, num):
        times = 0
        for number in numbers:
            if num == number:
                times += 1
        if times * 2 <= len(numbers):
            return False
        return True
    def MoreThanHalfNum_Solution(self, numbers):
        # write code here
        if numbers == []:
            return 0
        result = self.partitionOfK(numbers, 0, len(numbers) - 1, len(numbers) >> 1)
        if self.checkMoreThanHalf(numbers, result):
            return result
        else:
            return 0

class Solution:
	def checkMoreThanHalf(self, numbers, num):
		times = 0
		for number in numbers:
			if num == number:
				times += 1
		if times * 2 <= len(numbers):
			return False
		return True
	def MoreThanHalfNum_Solution(self, numbers):
		if numbers == []:
			return 0
		result = numbers[0]
		times = 1
		for i in range(1, len(numbers)):
			if times == 0:
				result = numbers[i]
				times = 1
			elif numbers[i] == result:
				times += 1
			else:
				times -= 1
		if self.checkMoreThanHalf(numbers, result):
			return result
		else:
			return 0