Sum of Subsets problem implemented in java

SumOfSubsets.java

import java.util.Arrays;

public class SumOfSubsets {
	private static int required;
	private static int[] arr;
	private static int n;
	
	private static void fun(int i, int[] sol, int sum, int remaining) {
		if (remaining >= 0 && sum <= required) {
			if (sum == required && remaining == 0) {
				System.out.println(Arrays.toString(sol));
			}
			
			if (i < n) {
				sol[i] = 1;
				fun(i + 1, sol, sum + arr[i], remaining - arr[i]);
				sol[i] = 0;
				fun(i + 1, sol, sum, remaining - arr[i]);
			}
		}
	}
	
	public static void main(String[] args) {
		arr = new int[]{1, 2, 3, 4, 5};
		required = 10;
		
		n = arr.length;
		int sum = 0;
		
		for (int a : arr) {
			sum += a;
		}
		
		fun(0, new int[n], 0, sum);
	}
}