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.

public int numSubarraysWithSum(int[] A, int S) {
        int res = 0;
        for (int i = 0; i < A.length; i++) {
            int sum = 0, j = i;
            if (A[j] > S) continue;
            if (sum == S) j++;
            while (sum < S) {
                if (j < A.length) {
                    sum += A[j++];
                } else {
                    break;
                }
            }
            if (sum == S) res += 1;
            try{
                while (A[j] == 0) {
                    res += 1;
                    j++;
                }
            } catch (Exception e) {
                continue;
            }
        }
        return res;
    }