摘要：
class Solution { public int findLength(int[] nums1, int[] nums2) { int ans = 0, len1 = nums1.length, len2 = nums2.length; for(int i = 0; i < len1; i++ 阅读全文
摘要：
public int subarraySum(int[] nums, int k) { int len = nums.length, ans = 0, pre = 0; Map<Integer, Integer> map = new HashMap<>(); map.put(0,1); for(in 阅读全文