You are viewing a single comment's thread. Return to all comments →
My java simple way...
static int solve(int n, int[] s, int d, int m) { int result = 0; for (int i=0; i<n; i++) { int limit = i + m; if (limit > n) { break; } int sum = 0; for (int j=i; j<limit; j++) { sum += s[j]; } if (sum == d) { ++result; } } return result; }
Seems like cookies are disabled on this browser, please enable them to open this website
Subarray Division
You are viewing a single comment's thread. Return to all comments →
My java simple way...