《leetCode》:Majority Element
来源:互联网 发布:富春江知乎 编辑:程序博客网 时间:2024/06/05 03:04
题目
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.
思路
先排序,取中间的即可。
更多的思路可以看这篇博文:http://blog.csdn.net/u010412719/article/details/49047033
int cmp(const void *a,const void *b){ return ((*(int*)a)-(*(int*)b));}int majorityElement(int* nums, int numsSize) { if(nums==NULL||numsSize<1){ return 0; } qsort(nums,numsSize,sizeof(nums[0]),cmp); return nums[numsSize/2];}
1 0
- 【leetcode】Majority Element II,Majority element algorithm
- Leetcode: Majority Element &Majority Element II
- Leetcode Majority Element
- leetcode 169-Majority Element
- 【leetcode 哈希表】Majority Element
- LeetCode:Majority Element
- leetcode:Majority Element
- leetcode: Majority Element
- [LeetCode] Majority Element
- leetcode 153: Majority Element
- leetcode Majority Element
- LeetCode:Majority Element
- leetcode:Majority Element
- [LeetCode] Majority Element
- Leetcode-Majority Element
- [leetcode]Majority Element
- [LeetCode]Majority Element
- Leetcode: Majority Element
- ACM:HDU-1002 A + B Problem II
- mybatis和hibernate本质区别和应用场景
- Android周记录一
- PHP session文件锁住及解决
- Android Studio adb无法启动解决方案
- 《leetCode》:Majority Element
- Python Version 2.7 requires , which was not found in the registy 问题解决
- 数据库中表的某属性2级查询问题的实现
- Thread的run与start的区别
- 汇编之路-2
- mp4格式介绍
- c++异常详解
- Kubernetes是什么?
- linux限制IP远程登录