1.非连续求法
dfs求子数组
2.连续
每次增加数组的步长,求出来所有的和
private void subSum(int[] nums) {
int[] sum = new int[nums.length];
for (int len = 1; len <= nums.length; len++) {
for (int i = 0; i+len <= nums.length; i++) {
sum[i] = sum[i] + nums[i+len-1];
System.out.println(sum[i]);
}
System.out.println();
}
}