169. Majority Element
来源:互联网 发布:李医生祛痘洁面乳 知乎 编辑:程序博客网 时间:2024/06/10 17:46
问题描述:
Given an array of size n, find the majority element. The majority element is the element that appearsmore than ⌊ n/2 ⌋
times.
You may assume that the array is non-empty and the majority element always exist in the array.
解题思路:
首先,该题的意思是找出相同元素超过一半的元素,那么,就可以以成对的方式来进行查询,以count计量,相同count++,出现不一样的count--,最后就能找到n/2的元素。
#include "stdio.h"
int majorityElement(int *nums,int numsSize){
int i,count=1,major=nums[0];
for(i=1;i<numsSize;i++)
{
if(count==0){
count++;
major=nums[i];
int majorityElement(int *nums,int numsSize){
int i,count=1,major=nums[0];
for(i=1;i<numsSize;i++)
{
if(count==0){
count++;
major=nums[i];
}
else if(major==nums[i]) count++;
else count--;
printf("%d\n",major);
}
printf("%d\n",major);
return major;
}
else if(major==nums[i]) count++;
else count--;
printf("%d\n",major);
}
printf("%d\n",major);
return major;
}
void main()
{
int a[20]={3,4,5,2,3,4,5,3,4,3,7,3,6,7,9,0,3,8,3,2};
majorityElement(a,20);
}
{
int a[20]={3,4,5,2,3,4,5,3,4,3,7,3,6,7,9,0,3,8,3,2};
majorityElement(a,20);
}
阅读全文
0 0
- 169.Majority Element && 229. Majority Element II
- [LeetCode]169.Majority Element
- LeetCode 169.Majority Element
- 【LeetCode】169.Majority Element
- LeetCode 169. Majority Element
- LeetCode 169. Majority Element
- 169.Majority Element
- [leetcode] 169.Majority Element
- 169. Majority Element
- Leetcode 169. Majority Element
- 【LeetCode】169. Majority Element
- [LeetCode]169. Majority Element
- 169. Majority Element LeetCode
- 169. Majority Element
- 169. Majority Element
- LeetCode 169. Majority Element
- LeetCode 169. Majority Element
- Leetcode 169. Majority Element
- Unity游戏存档-PlayerPrefs类
- iOS
- 简单的加密算法(MD5,base64,ASE)
- 自动预测保险理赔:机器学习之特征预处理(Kaggle保险索赔竞赛案例)
- 索引优化(二)
- 169. Majority Element
- Linux系统调用列表(二)
- MongoDB修改数据类型
- 两种数组去重方法比较
- 机器学习、数据挖掘方面好书、网站推荐
- php正则的高级应用
- 机器学习系列(18)_Kaggle债务违约预测冠军经验分享
- Android View绘制机制基础(一)
- 高级UI之SVG画台湾地图