1354. Construct Target Array With Multiple Sums

class Solution {
    public boolean isPossible(int[] target) {
        long sum =0;
        int max=0;
        
        for(int i=0;i<target.length;i++){
            sum += target[i];
            if(target[max]<target[i]){
                max = i;
            }
        }
        
        
        long diff = sum - target[max];
        
        if(target[max] == 1 || diff == 1) return true;

        if(diff>target[max] || diff == 0 || target[max]%diff==0) return false;
        
        target[max] %= diff;
        
        return isPossible(target);
    }
}

//TC O(n*logN) SC O(N)
class Solution {
    public boolean isPossible(int[] target) {
        long sum =0;
        
        PriorityQueue<Integer> pq=new PriorityQueue<Integer>((a,b)->b-a);
        
        for(int i=0;i<target.length;i++){
            sum += target[i];
            pq.offer(target[i]);
        }
        
        while(pq.peek()!=1){
            int value = pq.poll();
            long diff = sum - value;

            if(diff == 1) return true;

            if(diff>value || diff == 0 || value%diff==0) return false;

            value %= diff;
            sum = diff + value;
            pq.offer(value);
        }
        return true;
    }
}