Bag of Tokens LeetCode solution in C++

1
class Solution {
2
 public:
3
  int bagOfTokensScore(vector<int> &tokens, int power) {
4
    sort(tokens.begin(), tokens.end());
5
    int start = 0, end = tokens.size() - 1, score = 0, ans = 0;
6
    while (start <= end) {
7
      if (power >= tokens[start]) {
8
        ans = max(ans, ++score);
9
        power -= tokens[start++];
10
      } else if (score > 0) {
11
        score--;
12
        power += tokens[end--];
13
      } else {
14
        return 0;
15
      }
16
    }
17
    return ans;
18
  }
19
};