Given a vector:
[1 0 -1 3 2 -3 1]
and a window of 2,
A sliding window would find:
1 + 0 = 1 0 - 1 = -1 -1 + 3 = 2 3 + 2 = 5 2 - 3 = -1 -3 + 1 = -2
Meaning that three of the windows were positive.
Given a vector and a window, how many of the windows sum to be positive, not zero or negative?
I think test suite 3 produces 4 positives, not 3.
I agree with the above comments
Oops. Fixed. thank you.
Test suite 3 doesn't seem to be correct. Total windows possible in this case is 2. How can number of positive windows be greater than that. Someone please clarify.
cool
e what they mean by window so if someone could explain that would be greatly appreciated.
Window is how many numbers you are adding together for every position
Sort a list of complex numbers based on far they are from the origin.
3555 Solvers
1046 Solvers
Do Fast Fourier Transformation
166 Solvers
194 Solvers
248 Solvers