题目
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:1
2Input: [3,2,3]
Output: 3
Example 2:1
2Input: [2,2,1,1,1,2,2]
Output: 2
思路
本来想强行暴力,解决问题,但无奈时间超限
暴力法 run time error
1 | int *num= (int *) malloc(sizeof(int)); |
时间简短版
1 | int cmpfunc (const void * a, const void * b) |