import java.util.HashMap;

public class leetcode560 {
    public static void main(String[] args) {
        int[] num = new int[]{1,1,1};
        Solution so = new Solution();
        System.out.println(so.subarraySum(num,2));
    }

    static class Solution {

        public int subarraySum(int[] nums, int k) {
            int sum  = 0;
            if (nums == null || nums.length == 0) return 0;
            //dp[i]表示前i个数的和
            int