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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
public class Solution {public int MajorityElement(int[] nums) {int length = nums.Length;int halfLength = length / 2;Dictionary<int, int> d = new Dictionary<int, int>();int value = 0;int num = 0;for (int i = 0; i < length; i++) {num = nums[i];if (d.TryGetValue(num, out value)) {d[num] += 1;} else {d[num] = 1;}}int element = 0;foreach (int i in d.Keys) {if (d[i] > halfLength) {element = i;}}return element;}}
169.求数组中出现次数最多的元素 Majority Element
原文:http://www.cnblogs.com/xiejunzhao/p/22dca9ca828f0fd64a6d2541865bc657.html