leetcode169

public class Solution {
    public int MajorityElement(int[] nums) {
        Dictionary<int, int> dic = new Dictionary<int, int>();

            var len = nums.Length;

            for (int i = 0; i < len; i++)
            {
                if (!dic.ContainsKey(nums[i]))
                {
                    dic.Add(nums[i], 1);
                }
                else
                {
                    dic[nums[i]]++;
                }
            }

            var result = 0;

            foreach (var d in dic)
            {
                if (d.Value > len / 2)
                {
                    result = d.Key;
                    break;
                }
            }
            return result;
    }
}

https://leetcode.com/problems/majority-element/#/description

 

补充一个python的实现：

class Solution:
    def majorityElement(self, nums: 'List[int]') -> int:
        dic = {}
        length = len(nums)
        for n in nums:
            if n not in dic:
                dic[n] = 1
            else:
                dic[n] += 1
            if dic[n] > length // 2:
                return n