Could I know whether the sliding window approach could solve the integer…including the negative num/?
I tried to solve the problem “Maximum size subarray sum equals to K”?
But it can’t work
Could I know whether the sliding window approach could solve the integer…including the negative num/?
I tried to solve the problem “Maximum size subarray sum equals to K”?
But it can’t work