leetcode 【 Majority Element 】python 实现

提示：扫一扫查出行
【扫一扫了解最新限行尾号】
复制提示

题目：

Given an array of size n , find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

代码：oj测试通过 Runtime: 197 ms

 class Solution:

     # @param num, a list of integers

     # @return an integer

     def majorityElement(self, num):

         if len(num) == 1:

             return num[0]

         candidate = 0

         count = 0

         for i in range(len(num)):

             if count == 0:

                 candidate = num[i]

                 count += 1

             else:

                 if num[i] == candidate :

                     count += 1

                 else:

                     count -= 1

         return candidate