169. Majority Element - Leetcode Python Solution

 169. Majority Element

Given an array nums of size n, return the majority element.

The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

Example 1:

Input: nums = [3,2,3]

Output: 3

Example 2:

Input: nums = [2,2,1,1,1,2,2]

Output: 2

Constraints:

n == nums.length

1 <= n <= 5 * 104

-109 <= nums[i] <= 109

Follow-up: Could you solve the problem in linear time and in O(1) space?

In [ ]:

import math
from typing import List
class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        nums.sort()
        return nums[math.floor(len(nums)/2)]
s = Solution()
s.majorityElement([2,2,1,1,1,2,2])

Out[ ]:

2

In [ ]:

import math
from typing import List
class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        count=0
        majority = None
        for i in nums:
          if count==0:
            majority = i
          if majority!=i:
            count=count-1
          else:
            count=count+1
        return majority
s = Solution()
s.majorityElement([2,2,1,1,1,2,2])

Out[ ]:

2