<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) {
        bool firstA = true;
        if(b>a) firstA = false;
        string ans = "";
        int divison;
        if(firstA){
            divison = (a+1)/2;
        }else{
            divison = (b+1)/2;
        }
        int a_pair = a - divison;
        int b_pair = b - divison;

        while(a>0 || b>0){
            if(firstA && a>0){
               if(a_pair > 0){
                ans = ans + "aa";
                a_pair--;
                a = a-2;
               }
               else{
                ans = ans + "a";
                a = a-1;
               }
            }else{
                if(b_pair > 0){
                ans = ans + "bb";
                b_pair--;
                b = b-2;
               }
               else{
                ans = ans + "b";
                b--;
               }
            }
            firstA = !firstA;
        }
    return ans;
    }
};
8500