LeetCode-930. Binary Subarrays With Sum

In an array A of 0s and 1s, how many non-empty subarrays have sum S?

 

Example 1:

Input: A = [1,0,1,0,1], S = 2
Output: 4
Explanation: 
The 4 subarrays are bolded below:
[1,0,1,0,1]
[1,0,1,0,1]
[1,0,1,0,1]
[1,0,1,0,1]

 

Note:

1. A.length <= 30000
2. 0 <= S <= A.length
3. A[i] is either 0 or 1.

题解：

很差的方法，其他方法的case太多。

class Solution {
public:
  int numSubarraysWithSum(vector<int>& A, int S) {
    int ans = 0;
    int n = A.size();
    for (int i = 0; i < n; i++) {
      int sum = A[i];
      int j = i + 1;
      while (sum < S && j < n) {
        sum += A[j];
        j++;
      }
      if (sum == S) {
        ans++;
        while (A[j] == 0 && j < n) {
          j++;
          ans++;
        }
      }
    }
    return ans;
  }
};