class Solution {
public int lastStoneWeight(int[] stones) {
int len = stones.length;
if(len == 1){
return stones[0];
}
if(len == 2){
return Math.abs(stones[0] - stones[1]);
}
while(true){
Arrays.sort(stones);
if(stones[len - 2] == 0){
break;
}
stones[len - 1] = stones[len - 1] - stones[len - 2];
stones[len - 2] = 0;
}
return stones[len - 1];
}
}
代码随想录——最后一块石头的重量(Leetcode1046)
最新推荐文章于 2024-07-19 19:25:43 发布