# ---
# title: 169. Majority Element
# id: problem169
# author: Tian Jun
# date: 2020-10-31
# difficulty: Easy
# categories: Array, Divide and Conquer, Bit Manipulation
# link: <https://leetcode.com/problems/majority-element/description/>
# hidden: true
# ---
# 
# 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
#     
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
