Test Max SubSet

TestSubSetProblem.java

package com.dgstack.dev.test_dev;

import java.util.Arrays;

public class TestSubSetProblem {

	
	public static void main(String[] args) {
		
		
		int[] arr = {-1, 8, 4, -2, 5, -5};
		
		Arrays.sort(arr);
		
		int len = arr.length;
		int s =0 , e = 0;
		print(arr);
		int max = arr[len -1];
		for(int i = len; i >= 0; i--){
			for (int j = 1; j <= i; j++) {
				int sm = sum(Arrays.copyOfRange(arr, i-j, i));
				if(sm < max){
					break;
				}else{
					max = sm;
					s = i-j;
					e = i;
				}
			}
		}
		
		print(Arrays.copyOfRange(arr, s, e));
		
	}
	
	static  void print(int[] a){
		for (int i : a) {
			System.out.print(i+ ", ");
		}
		System.out.println();
	}
	
	static int sum(int[] a){
		int sum = 0;
		for (int i : a) {
			sum+=i;
		}
		//print(a);
		return sum; 
	}
	
}