Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
2n list int 每次从最左端/右取n个数字,取出来数最大
升序的list,正整数,target,找index,二分查找
Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
2n list int 每次从最左端/右取n个数字,取出来数最大
升序的list,正整数,target,找index,二分查找