[Java] Simple recursion
Intuition:\n\n- Obviously if a==b just append the mix ab until count gets zero. \n- Then if not equal, let\'s make it equal. So just use one more character of w
Intuition:\n\n- Obviously if `a==b` just append the mix `ab` until count gets zero. \n- Then if not equal, let\'s make it equal. So just use one more character of whichever has a larger count.\n\n```\nclass Solution {\n    public String strWithout3a3b(int a, int b) {\n        if (a == 0 && b == 0) return "";\n        if (a == 0) return "b" + strWithout3a3b(a, b - 1);\n        if (b == 0) return "a" + strWithout3a3b(a - 1, b);\n        if (a == b) return "ab" + strWithout3a3b(a - 1, b - 1);\n        if (b > a) return "bba" + strWithout3a3b(a - 1, b - 2);\n        // a > b\n        return "aab" + strWithout3a3b(a - 2, b - 1); \n    }\n}\n```
[]