Description:
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:
- A.length <= 30000
- 0 <= S <= A.length
- A[i] is either 0 or 1.
题意:给定一个只包含数字0和1的数组A, 和一个整数S,计算数组A的所有子数组中满足1的个数为S的数量;
解法:定义一个新的数组sumOne,用来存储数组A中当前下标位置处1的个数(即从下标0开始到当前下标位置处1的个数);这样,我们只要找到sumOne中所有满足两个位置处的1的个数差为S的情况即可;
例如:对于数组A = [1,0,1,0,1],我们可以得到数组sumOne = [1,1,2,2,3] ;
Java
class Solution {
public int numSubarraysWithSum(int[] A, int S) {
if (A.length == 0) return 0;
int result = 0;
int[] sumOne = new int[A.length];
int st = 0;
int ed = 0;
sumOne[0] = A[0] == 1 ? 1 : 0;
for (int i = 1; i < A.length; i++) {
sumOne[i] = A[i] == 1 ? 1 + sumOne[i - 1] : sumOne[i - 1];
}
while (st < A.length) {
ed = st;
while (ed < A.length) {
int sum = st == 0 ? sumOne[ed] : sumOne[ed] - sumOne[st - 1];
if (sum > S) break;
result = sum == S ? result + 1 : result;
ed++;
}
st++;
}
return result;
}
}