【LeetCode】出现次数最多的元素

一个数组中，统计出现最多的元素

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<set>

using namespace std;

int main(){
	int a[]={2, 3, 3, 5, 3, 6};
	int c = 2;
	int k = 1;
	for(int i=1; i<6; i++){
		if(a[i] == c){
			k++;
		}else{
			k--;
		}
		if(k == 0){
			k = 1;
			c = a[i];
		}
	}
	cout<<c;
	return 0;
}