摘要： 一整数（有正有负）数组，用尽量少的时间计算数组中和为某个整数的所有子数组 1 public class SumK { 2 3 public static void main(String[] args) { 4 5 int[] array = {4,5,2,4,7,1,8,-3,6,3,2,6,1,4,-6,7,-4,2,-1,8,5,2,7,4,3}; 6 int k = 11; 7 Map set = new HashMap(); 8 int[] sum = new int[array.length... 阅读全文