今日头条手写代码-找出指定规则下和最大的子数组

import java.util.*;

public class Main{

public static int sum(List<Integer> list){
int sum =0 ;
for(Integer i:list){
sum+=i;
}
return sum;
}

private static int ans= 0;
private static List<Integer> ansList = null;

public static void dfs(int arr[],int pos,ArrayList<Integer> res){
if(pos >= arr.length){
int sum = sum(res);
if(ans < sum){
ansList = res;
ans = sum;
}
return;
}
// not choose
dfs(arr,pos+1,res);
// choose
ArrayList<Integer> newList = new ArrayList<Integer>(res);
newList.add(arr[pos]);
dfs(arr,pos+2,newList);
HashSet->HashMap
}

public static void main(String[] args){
int arr[] = new int[]{3, 5, 2, 4, -10, 8, 2, 4};
dfs(arr,0, new ArrayList<Integer>());
System.out.println(ans);
for(Integer i : ansList){
System.out.print(i+" ");
}
System.out.println();
}

}