统计一个数组中，出现次数最多的元素。返回这个元素和出现的次数

    # 1.Java

    //遍历list，将元素当做key，首次存入map，value=1，如果下一个元素已存在map，value+1
    public String statisticsListEle(List<Object> list){
        Map<String, Integer> map = new HashMap();

        for (int i = 0; i < list.size(); i++) {
            if (map.containsKey(list.get(i))){
                map.put(list.get(i), map.get(list.get(i))+1);
            }else {
                map.put(list.get(i), 1);
            }
        }
        int max = 0;
        String maxKey = null;

        for (Map.Entry<String, Integer> entry: map.entrySet()
             ) {
            if (entry.getValue()>max){
                max = entry.getValue();
                maxKey = entry.getKey();
            }
        }
        return maxKey+":"+max;
    }

 # 2.c

#include <iostream>

#include <string>

#include <map>

using namespace std;

int main() {

    string str;

    cin>>str;

    if(str == "") return -1;

    map<char, int> m;

    for(auto i : str){

        m[i]++;

    }

    char res;

    int resnum=0;

    for(auto p : m){

        if(resnum < p.second){

            resnum = p.second;

            res = p.first;

        }

    }

    cout<<res<<resnum<<endl;

    return 0;

}