LCP.P50[宝石补给]

发表于2023-09-15|更新于2023-09-15|LeetCode

|字数总计:89|阅读时长:1分钟|阅读量:

方法一：模拟

class Solution {
    public int giveGem(int[] gem, int[][] operations) {
        int max = 0, min = Integer.MAX_VALUE;
        for (int[] op : operations) {
            int x = op[0], y = op[1], val = gem[x] >> 1;
            gem[y] += val;
            gem[x] -= val;
        }
        for (int x : gem) {
            max = Math.max(max, x);
            min = Math.min(min, x);
        }
        return max - min;
    }
}