class Solution {
public int lastStoneWeight(int[] stones) {
Arrays.sort(stones);
int len = stones.length - 1;
for(int i = len; i > 0; i --) {
stones[len] = stones[len] - stones[len - 1];
stones[len - 1] = 0;
Arrays.sort(stones);
}
return stones[len];
}
}
/**
模拟过程:
[1,1,2,4,7,8] -> [1,1,2,4,7,1] -> [1,1,2,4,0,1]
[0,1,1,1,2,4] -> [0,1,1,1,2,2] -> [0,1,1,1,0,2]
[0,0,1,1,1,2] -> …………
**/
leetcode 1046. 最后一块石头的重量
最新推荐文章于 2023-06-25 22:54:40 发布