Input v is a row vector such that length(v)>3. Consider a sliding window of length 3 that is used to calculate the local average of the elements. Return the three consecutive elements that maximizes such average according to the order they appear in v in a row vector.
Example:
Input: v=[1 2 3 4 5 6 7 8 9 -3 0 1];
Output: vOut=[7 8 9];
The consecutive elements [7 8 9] have the highest average among all such consecutive sub-vectors. For a tie case, return the first triplet according to appearance in v.
1313 Solvers
748 Solvers
Permute diagonal and antidiagonal
179 Solvers
329 Solvers
We love vectorized solutions. Problem 1 : remove the row average.
385 Solvers
Solution 450773
Will fail on [0 0 0 0] or any longer vector of 0's.
I know... ;-) but it passes all the cases.
I implement this other solution before: http://www.mathworks.de/matlabcentral/cody/problems/2349-elements-with-highest-local-average/solutions/450770