Puppy Treat (Array)

There are N puppies. The i-th puppy has Ti treats, where i belongs to 1 to N (input limits on T, N)
You want all puppies to have equal treats.However, you're only allowed to do the following operation
Choose a puppy i. Give 1 treat to all puppies except puppy i. Thus, if the treats were originally T1, T2, T3, T4, T5 and you choose the 3rd puppy,
then the treats after this operation would be (T1 + 1), (T2 + 1), T3, (T4 + 1), (T5 + 1)

You are allowed to make this operation as many times as you want, choosing some puppy during each operation.
What is the minimum number of operations that you must perform, to make sure that all puppies end up with equal treats?

Sample test case:

N = 3, T = [1,2,3]
1, 2, 3
2, 3, 3
3, 4, 3
4, 4, 4

Output = 3

Answer:

The approach is to convert the logic from add 1 to every element except the selected element to, Subtract 1 from the selected element
1, 2, 3
1, 2, 2
1, 2, 1
1, 1, 1

Code:

public class Prog{
    public static int minimum (int[] arr){
        int min=Integer.MAX_VALUE;
        for(int i=0;i<arr.length;i++)
            if(arr[i]<min)
                min=arr[i];
        return min;
    }
    public static int puppyBites(int n, int[] arr){
        int count=0;
        int min=minimum(arr);
        for(int i=0;i<arr.length;i++)
        {
            if(arr[i]==min)
                continue;
            else{
                count+=(arr[i]-min);
                arr[i]=min;
            }
        }
        return count;
    }
    public static void main(String args[]){
        int[] arr={1,2,3};
        System.out.println("Output="+puppyBites(3, arr));
    }
}
                

Output:

Output=3