hard我唯唯诺诺,easy我重拳出击
class Solution {
public:
int lastStoneWeight(vector<int>& stones)
{
int len=stones.size()-1;
for(int i=0;i<len;i++)
{
sort(stones.begin(),stones.end());
if(stones[len-1]==0)
{
break;
}
stones[len]-=stones[len-1];
stones[len-1]=0;
}
return stones[len];
}
};
然后看了题解,好家伙,原来这个题目要用大根堆,芝士盲区,还是要好好学习吖