2023-09-15力扣每日一题

链接：

[LCP 50. 宝石补给](https://leetcode.cn/problems/queens-that-can-attack-the-king/)

题意

略

解：

简单题 模拟

实际代码：

int giveGem(vector& gem, vector>& operations) {
        for(auto operation:operations)
        {
            int half=gem[operation[0]]>>1;

            gem[operation[0]]-=half;
            gem[operation[1]]+=half;
        }
        int Max=INT_MIN,Min=INT_MAX;
        for(auto g:gem)
        {
            Max=max(Max,g);
            Min=min(Min,g);
        }
        return Max-Min;
    }
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

限制：

• 2 <= gem.length <= 10^3
• 0 <= gem[i] <= 10^3
• 0 <= operations.length <= 10^4
• operations[i].length == 2
• 0 <= operations[i][0], operations[i][1] < gem.length