Кухня(); Задание N33.

public static int getMostPopularNumber(int[] data) {
        int[] popular = new int[data.length];

        for (int i = 0; i < data.length; i++) {
            for (int j = 0; j < data.length; j++) {
                if (data[i] == data[j]) {
                    popular[i]++;
                }
            }
        }

        int valResult = data[0];
        int popResult = popular[0];
        for (int i = 0; i < popular.length; i++) {
            if (popular[i] > popResult) {
                popResult = popular[i];
                valResult = data[i];
            }
            if ((popResult == popular[i]) && (data[i] < valResult)) {
                valResult = data[i];
            }
        }
        return valResult;

    }

public static int getMinOfMaxFrequency(int...arr)
{
	int res=0;
	int[] counts=new int[arr.length];
	for (int i=0;i<arr.length;i++)
	{
		int count=1;
		for (int j=i+1;j<arr.length;j++)
		{
			if (arr[i]==arr[j])
				count++;
		}
		counts[i]=count;
		if (counts[i]==counts[res])
			res=arr[res]>arr[i]?i:res;
		else
			res=count>counts[res]?i:res;
	}
	return arr[res];
}