1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
    public long minimumHealth(int[] damage, int armor) {
        long sum = 0;
        long max = -1;
        for (int num : damage) {
            max = Math.max(max, num);
            sum += num;
        }
        if (armor >= max) {
            sum -= max;
        } else {
            sum -= armor;
        }
        return sum + 1;
    }
}

偶然发现的题. 应该是easy 难度.