Last Stone Weight LeetCode solution in C++

1
class Solution {
2
 public:
3
  int lastStoneWeight(vector<int> &stones) {
4
    while (stones.size() > 1) {
5
      sort(stones.begin(), stones.end(), greater<int>());
6
      stones[1] = (stones[0] - stones[1]);
7
      stones.erase(stones.begin());
8
    }
9
    return stones[0];
10
  }
11
};