class Solution {
public:
int lastStoneWeight(vector<int>& stones)
{
while (1)
{
if (stones.size() == 1)
{
return stones[0];
}
if (stones.size() == 0)
{
return 0;
}
sort(stones.begin(), stones.end());
int s1 = stones[stones.size() - 1];
stones.pop_back();
int s2 = stones[stones.size() - 1];
stones.pop_back();
if (s1 - s2 != 0)
{
int temp=s1 > s2 ? (s1 - s2) : (s2 - s1);
stones.push_back(temp);
}
}
}
};
07-23
07-23
07-23
07-23