Given a binary array numsand an integer goal, return the number of non-empty subarrays with a sum goal.
(相关资料图)
A subarray is a contiguous part of the array.
Example 1:
Input: nums = [1,0,1,0,1], goal = 2
Output: 4
Explanation:
The 4 subarrays are bolded and underlined below:
[1,0,1,0,1]
[1,0,1,0,1]
[1,0,1,0,1]
[1,0,1,0,1]
Example 2:
Input: nums = [0,0,0,0,0], goal = 0
Output: 15
pre_sum题型，会了1道，其他的基本都会了。
Constraints:
1 <= nums.length <= 3 * 104
nums[i]is either 0or 1.
0 <= goal <= nums.length
Runtime: 2241 ms, faster than 5.07% of Java online submissions for Binary Subarrays With Sum.
Memory Usage: 47 MB, less than 41.47% of Java online submissions for Binary Subarrays With Sum.
追回12亿美元罚款后 英特尔又向欧盟提出6.24亿美元利息索赔
iPhone 14全系涨价上热搜：还是Pro版最香
拜登支持苹果零售员工加入工会 称这能让产品更好
韩国最高法院裁定：三星未窃取LG OLED技术
报道称盒马区域业务裁员调整 采购线裁撤收归总部