I want to find out the maximum value of an array which holds numbers between 0 - 6. But the number 6 should be excluded. In my logic the 5 is the highest number, so I have to sort out the 6.
for (int i = 0; i < requirements.length; i++) {
for (int k = i + 1; k < requirements.length; k++) {
if(requirements[i] < requirements[k])
&& requirements[k] != 6) {
highest = requirements[k];
} else {
if(requirements[i] != 6) {
highestAsilLevel = requirements[i];
}
}
}
}
I got this far, but this won't work for any case.