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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Subarray Division
  5. Discussions

Subarray Division

  • milyutin_maxim
     + 1 comment

    My C# solution:

    static int birthday(List<int> s, int d, int m) {

    int sumCount = 0;
    int sLength = s.Count;
    if (m <= sLength) {
        int curSum = 0;
        for (int j=0; j<m; j++) {
            curSum += s[j];
        }

        if (curSum == d) {
            sumCount++;
        }

        for (int j=m; j<sLength; j++) {
            curSum += s[j] - s[j-m];
            if (curSum == d) {
                sumCount++;
            }
        }
    }

    return sumCount;
}