Minimum Amount of Time to Fill Cups LeetCode solution in Java

1
class Solution {
2
  public int fillCups(int[] amount) {
3
    Arrays.sort(amount);
4
    int x = amount[0];
5
    int y = amount[1];
6
    int z = amount[2];
7
    int sum = x + y + z;
8
    if (x + y > z) {
9
      return sum / 2 + sum % 2;
10
    }
11
    if (x == 0 && y == 0) {
12
      return z;
13
    } else {
14
      return z;
15
    }
16
  }
17
}