Menu
I'm trying to count the longest string of consecutively increasing elements in a randomly generated array, MOODS. This code always returns one less than what is correct.
int maxDays = 0;
int days = 0;
for (int i = 0; i < MOODS.size() - 1; i++) {
if (MOODS.get(i + 1) > MOODS.get(i)) {
days += 1;
if(days>maxDays){
maxDays=days;
}
} else {
days = 0;
}
}
return maxDays;
}
637
The frequency of an element can be counted using two loops. One loop will be used to select an element from an array, and another loop will be used to compare the selected element with the rest of the array. Initialize count to 1 in the first loop to maintain a count of each element.
So, total of 6 subarrays are increasing. Note:You only need to implement the given function.
To increment a value in an array, you can use the addition assignment (+=) operator, e.g. arr[0] += 1 . The operator adds the value of the right operand to the array element at the specific index and assigns the result to the element.
Below are the steps: If arr[1] > arr[0], then check for strictly increasing then strictly decreasing as: Check for every consecutive pair until at any index i arr[i + 1] is less than arr[i]. Now from index i + 1 check for every consecutive pair check if arr[i + 1] is less than arr[i] till the end of the array or not.
You will always have at least one increasing sequence of string with the length of 1. Just change days to 1 and it will work.
int maxDays = Math.min(1, MOODS.size());
int days = 1;
for (int i = 0; i < MOODS.size() - 1; i++) {
if (MOODS.get(i + 1) > MOODS.get(i)) {
days += 1;
if (days>maxDays){
maxDays=days;
}
} else {
days = 1;
}
}
return maxDays;
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
