Completa la función para encontrar la cuenta del elemento más frecuente de un array. Puedes asumir que la entrada es un array de enteros. Para una matriz vacía devuelve 0
public class NumberCounter {
public int repetitionCounter(int[] numbers){
int mayorRepetitions = 0;
int actualRepetitions = 0;
for(int number : numbers){
for(int comparator : numbers){
if(number == comparator){
actualRepetitions += 1;
}
}
if(actualRepetitions > mayorRepetitions){
mayorRepetitions = actualRepetitions;
}
actualRepetitions = 0;
}
return mayorRepetitions;
}
}
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.assertEquals;
class SolutionTest {
NumberCounter main = new NumberCounter();
@Test
void testRepetitonCounter() {
int[] numbers = new int[6];
numbers[0] = 1;
numbers[1] = 2;
numbers[2] = 1;
numbers[3] = 3;
numbers[4] = 1;
numbers[5] = 5;
assertEquals(3,main.repetitionCounter(numbers));
int[] testZero = new int[0];
assertEquals(0,main.repetitionCounter(testZero));
}
}
crea una implementacion para la interfaz "MysteryColorAnalyzerImpl".
import java.util.ArrayList;
import java.util.List;
public class ColorManager implements MysteryColorAnalyzerImpl{
@Override
public int numberOfDistinctColors(List<Color> mysteryColors) {
int numDifferentColors;
List<Color> listDifferentColors = new ArrayList<>();
for(Color color : mysteryColors){
if( ! listDifferentColors.contains(color)){
listDifferentColors.add(color);
}
}
numDifferentColors = listDifferentColors.size();
return numDifferentColors;
}
@Override
public int colorOccurrence(List<Color> mysteryColors, Color color) {
int colorRepetitions = 1;
for(Color compareColor : mysteryColors){
if(color == compareColor){
colorRepetitions += 1;
}
}
return colorRepetitions;
}
}
resolucion primera tarea . emcapsular dando modificadores de acceso correctamente.
public class People {
private int age;
private String name;
private String lastName;
private String GREET="hello";
public String greet(){
return GREET +" my name is "+ name;
}
}