Time: 237 ms (12.61%) | Memory: 17.1 MB (99.51%) - LeetSync

966-binary-subarrays-with-sum/binary-subarrays-with-sum.py

@@ -0,0 +1,16 @@
+class Solution:
+    def numSubarraysWithSum(self, nums: List[int], goal: int) -> int:
+        def helper(x):
+            if x < 0: return 0
+
+            res = 0
+            l, cur = 0, 0
+            for r in range(len(nums)):
+                cur += nums[r]
+                while cur > x:
+                    cur -= nums[l]
+                    l += 1
+                res += (r - l + 1)
+            return res
+
+        return helper(goal) - helper(goal - 1)