Majority Element.md

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.

Example 1:

Input: [3,2,3]
Output: 3
Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2

My code:

class Solution(object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        tmp_dict={}
        for i in range(len(nums)):
            if nums[i] not in tmp_dict:
                tmp_dict[nums[i]]=1
            else:
                tmp_dict[nums[i]]+=1
            if tmp_dict[nums[i]]>len(nums)/2:
                return nums[i]
        return None

Solution: https://leetcode.com/problems/majority-element/