<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){
        string s="";
        if(a>=b){
            while(a>0 and b>0){
                s+='a';
                s+='b';
                a--;
                b--;
            }
        }
        else{
            while(a>0 and b>0){
                s+='b';
                s+='a';
                a--;
                b--;
            }
        }
        
        string g="";
        int i=0;
        while(i<s.size() and a>0){
            g+=s[i];
            i++;
            g+='a';
            if(i<s.size()){
                g+=s[i];
                i++;
            }
            a--;
        }       
        while(i<s.size()){
            g+=s[i];
            i++;
        } 
        while(a>0){
            g+='a';
            a--;
        }
        string r="";
        i=0;
        while(i<g.size() and b>0){
            r+=g[i];
            i++;
            r+='b';
            if(i<g.size()){
                r+=g[i];
                i++;
            }
            b--;
        } 
        while(i<g.size()){
            r+=g[i];
            i++;
        }
        while(b>0){
            r+='b';
            b--;
        }
        return r;
    }
};
7800