LintCode "Coins in a Line"

Recursion + Memorized Search(DP). And apparently, the code below can be iterative with only 3 vars - DP.

class Solution {
    unordered_map<int, bool> cache;
public:
    bool go(int n)
    {
        if (n <=) return false;
        if (n < ) return true;
 
        if(cache.find(n) == cache.end())
        {
            cache[n] = !go(n - ) || !go(n - );
        }
        return cache[n];
    }
    /**
     * @param n: an integer
     * @return: a boolean which equals to true if the first player will win
     */
     bool firstWillWin(int n) {
        return go(n);
    }
};