modify code

src/class23/Code01_SplitSumClosed.java

@@ -1,7 +1,5 @@
 package class23;
 
-import java.util.TreeSet;
-
 public class Code01_SplitSumClosed {
 
 	public static int right(int[] arr) {
@@ -12,19 +10,19 @@ public class Code01_SplitSumClosed {
 		for (int num : arr) {
 			sum += num;
 		}
-		TreeSet<Integer> ans = new TreeSet<>();
+		return process(arr, 0, sum >> 1);
-		process(arr, 0, 0, 0, ans, sum >> 1);
-		return ans.last();
 	}
 
-	public static void process(int[] arr, int i, int sum, int picks, TreeSet<Integer> ans, int limit) {
+	public static int process(int[] arr, int i, int rest) {
 		if (i == arr.length) {
-			if (sum <= limit) {
+			return 0;
-				ans.add(sum);
-			}
 		} else {
-			process(arr, i + 1, sum, picks, ans, limit);
+			int p1 = process(arr, i + 1, rest);
-			process(arr, i + 1, sum + arr[i], picks + 1, ans, limit);
+			int p2 = 0;
+			if (arr[i] <= rest) {
+				p2 = arr[i] + process(arr, i + 1, rest - arr[i]);
+			}
+			return Math.max(p1, p2);
 		}
 	}