<p>Given two integers <code>a</code> and <code>b</code>, return <strong>any</strong> string <code>s</code> such that:</p>

<ul>
	<li><code>s</code> has length <code>a + b</code> and contains exactly <code>a</code> <code>&#39;a&#39;</code> letters, and exactly <code>b</code> <code>&#39;b&#39;</code> letters,</li>
	<li>The substring <code>&#39;aaa&#39;</code> does not occur in <code>s</code>, and</li>
	<li>The substring <code>&#39;bbb&#39;</code> does not occur in <code>s</code>.</li>
</ul>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> a = 1, b = 2
<strong>Output:</strong> &quot;abb&quot;
<strong>Explanation:</strong> &quot;abb&quot;, &quot;bab&quot; and &quot;bba&quot; are all correct answers.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> a = 4, b = 1
<strong>Output:</strong> &quot;aabaa&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= a, b &lt;= 100</code></li>
	<li>It is guaranteed such an <code>s</code> exists for the given <code>a</code> and <code>b</code>.</li>
</ul>

class Solution {
public:
    string strWithout3a3b(int a, int b) {
        if(a == 0 && b == 0) return "";
        if(a == 0)return b == 2?"bb":"b";
        if(b == 0)return a == 2?"aa":"a";
        string ans = "";
        if(a >= 2*b || b >= 2*a){
            if(a>b){
                while(b){
                    ans += "aab";
                    a -= 2;
                    b--;
                }
                while(a){
                    ans += "a";
                    a--;
                }
                return ans;
            }
            else{
                while(a){
                    ans += "bba";
                    b -= 2;
                    a--;
                }
                while(b){
                    ans += "b";
                    b--;
                }
                return ans;
            }
        }

        if(a>b)return "ab" + strWithout3a3b(a-1,b-1);
        return "ba" + strWithout3a3b(a-1,b-1);
    }
};
8600