- int findmostappear(int *a,int len)
- {
- int candidate=0,count=0;
- for(int i=0;i<len;i++)
- {
- if(count==0)
- {
- candidate=a[i];
- count=1;
- }
- else
- {
- if(candidate==a[i])
- count++;
- else
- count--;
- }
- }
- return candidate;
- }
- //该片段来自于http://www.codesnippet.cn/detail/110320148955.html
来源: http://www.codesnippet.cn/detail/110320148955.html