human
Solve in 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.

Example 1:

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

Example 2:

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

What is a Python code to find the majority element?
assistant
#Here is Python code to find the majority element.

class Solution:
     def majorityElement(self, nums):
         """
         :type nums: List[int]
         :rtype: int
         """
         if not nums:
             return ""
         current = nums[0]
         counter = 1
         for i in range(1, len(nums)):
             if counter == 0:
                 current = nums[i]
                 counter = 1
             elif nums[i] == current:
                 counter += 1
             else:
                 counter -= 1
         return current