基础 sorted array查找最多的一个值.

            int pp = 1; //number of points in the same line of the point i
            if (k.size()==0){pp=0;} 
 
            for (int jj=1;jj<k.size();jj++){ //count pp
                if (k[jj]==k[jj-1]){
                    pp++;
                }else{
                    if (pp>res){res=pp}
                    pp = 1;
                }
            }
            if (pp+dup>res){res = pp+dup;}

            return res;

这种小逻辑 是黄金一般.