LeetCode 169 – Python 3 (Week 3 – 02)

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        dic = {}
        
        for num in nums:
            if num in dic:
                dic[num] += 1
            else:
                dic[num] = 1
        
        for v,k in dic.items():
            if k > len(nums)/2:
                return v

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
  
        #The number of majority element is more than n/2. Set the first number as the majority number. Count this number and not this number. When equal, delete this part. Go on...
        index, cnt = 0, 1
        
        for i in range(1,len(nums)):
            if nums[i] == nums[index]:
                cnt += 1
            else:
                cnt -= 1
                if cnt == -1:
                    index = i
                    cnt = 1

                    
        return nums[index]
        

class Solution:
    def majorityElement(self, nums):
        nums.sort()
        return nums[len(nums)//2]