948. Bag of Tokens

You have an initial power of power, an initial score of 0, and a bag of tokens where tokens[i] is the value of the ith token (0-indexed).

Your goal is to maximize your total score by potentially playing each token in one of two ways:

• If your current power is at least tokens[i], you may play the ith token face up, losing tokens[i] power and gaining 1 score.
• If your current score is at least 1, you may play the ith token face down, gaining tokens[i] power and losing 1 score.

Each token may be played at most once and in any order. You do not have to play all the tokens.

Return the largest possible score you can achieve after playing any number of tokens.

Example 1:

Input: tokens = [100], power = 50
Output: 0
Explanation: Playing the only token in the bag is impossible because you either have too little power or too little score.

Example 2:

Input: tokens = [100,200], power = 150
Output: 1
Explanation: Play the 0th token (100) face up, your power becomes 50 and score becomes 1.
There is no need to play the 1st token since you cannot play it face up to add to your score.

Example 3:

Input: tokens = [100,200,300,400], power = 200
Output: 2
Explanation: Play the tokens in this order to get a score of 2:
1. Play the 0th token (100) face up, your power becomes 100 and score becomes 1.
2. Play the 3rd token (400) face down, your power becomes 500 and score becomes 0.
3. Play the 1st token (200) face up, your power becomes 300 and score becomes 1.
4. Play the 2nd token (300) face up, your power becomes 0 and score becomes 2.

Constraints:

• 0 <= tokens.length <= 1000
• 0 <= tokens[i], power < 104

题目：嗯……这个题读着跟GRE题似的，说了半天不知道在说啥，看了例子才明白。一包token,可以翻过来，也可以扣过去。翻过来要消耗能量值power，但可以加分。扣过去可以增加能量值但扣分，问最多可以得多少分。

思路：先将tokens排序，双指针前一根后一根，power没了就从后面扣token，然后接着从前面翻牌，找出最大的score值。注意，不能认为power+tokens[j] < tokens[i]+tokens[i+1]就结束了，因为很可能power+tokens[j]+tokens[j-1] > tokens[i]+tokens[i+1]+tokens[i+2]，所以不能偷懒，还是需要遍历完全

代码：

class Solution {
public:
    int bagOfTokensScore(vector<int>& tokens, int power) {
        sort(tokens.begin(), tokens.end());
        int i = 0, j = tokens.size()-1, res = 0, score = 0;
        while(i <= j){
            if(power >= tokens[i]){
                power -= tokens[i++];
                score++;
            } else if(i >= j-1 || score == 0)
                return score;
            else {
                power += tokens[j--];
                score--;
            }
            res = max(res, score);
        }
        return score;
    }
};

time: O(N*logN), space: O(1)