Beats 95% | Very simple sol | Time - O(n) | Space - O(1)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool winnerOfGame(string colors) {\n        int n = colors.length();\n        int alice = 0; // how many alice can remove\n        int bob = 0; // how many bob can remove\n\n        for(int i=1;i<n-1;i++){\n            if(colors[i-1]==colors[i] && colors[i]==colors[i+1]){\n                if(colors[i]==\'A\') alice++;\n                else bob++;\n            }\n        }\n\n        return alice > bob;\n    }\n};\n```
['C++']