Leetcode 294. Flip Game II (回溯，记忆化)

 You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take turns to flip two consecutive "++" into "--". The game ends when a person can no longer make a move and therefore the other person will be the winner.

Write a function to determine if the starting player can guarantee a win.

For example, given s = "++++", return true. The starting player can guarantee a win by flipping the middle "++" to become "+--+".

Follow up:

Derive your algorithm's runtime complexity. 

题解：最明显的是递归回溯方法。如果保存中间结果，可大大节约时间！还有就是用博弈论SG函数更快。

class Solution {
public:
    bool canWin(string s) {    //朴素回溯，715MS
        int len=s.size();
        if(len<=1) return false;
        for(int i=0;i<len-1;i++) {
            string tmp=s;
            if(s[i]=='+'&&s[i+1]=='+') {
                tmp[i]='-';tmp[i+1]='-';
                bool f=canWin(tmp);
                if(!f) return true;
            }
        }
        return false;
    }
};

class Solution {
public:
    bool canWin(string s) {    //记录中间结果，39MS
        int len=s.size();
        if(len<=1) return false;
        if(Memory_Map.find(s)!=Memory_Map.end()) {
            return Memory_Map[s];
        }
        for(int i=0;i<len-1;i++) {
            string tmp=s;
            if(s[i]=='+'&&s[i+1]=='+') {
                tmp[i]='-';tmp[i+1]='-';
                bool f=canWin(tmp);
                if(!f) {
                    Memory_Map[s]=true;
                    return true;
                }
            }
        }
        Memory_Map[s]=false;
        return false;
    }
private:
    unordered_map<string,bool> Memory_Map;
};