GoLang Solution For LeetCode Problem: Majority Element
Solving Majority Element in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
You may assume that the array is non-empty and the majority element always exist in the array.
Input: [3,2,3] Output: 3
Input: [2,2,1,1,1,2,2] Output: 2
See the full details of the problem Majority Element at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go