We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. Birthday Chocolate
  5. Discussions

Birthday Chocolate

  • smhoyo + 1 comment

    My solution in Java:

    static int solve(int n, int[] s, int d, int m){
    int sum = 0;
    int r = 0;
    for (int i = 0; i < s.length; i++) {
        sum += s[i];
        // M is never less than 1
        if (i > m - 1) sum -= s[i - m];
        if (i >= m - 1 && sum == d) r++;
    }
    return r;
}
    • victorz + 0 comments

      This one uses a sliding window, just like my solution. I did it slightly differently by summing the first m digits in another loop.