leetcode 1354. Construct Target Array With Multiple Sums

Construct Target Array With Multiple Sums class Solution { public boolean isPossible(int[] target) { int[] arr = target; int n = arr.length - 1; Arrays.sort(arr); if(arr.length==2){ if(arr[0]==1 || arr[1]==1) return true; } do { arr[n] = arr[n] - (Arrays.stream(arr).sum() - arr[n]); if (arr[n] < 1) { return false; } Arrays.sort(arr); if (arr[n] < 1) { return false; } boolean c = true; if (arr[n] == 1) { for (int i = 0; i < n; i++) { if (arr[i] != 1) c = false; } return c; } } while (true); } }