<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 ans;
        int n = a + b;
        int i = 0, acount = 0, bcount = 0;
        while(i < n){
            if(b > a){
                if(bcount < 2 && b > 0){
                    ans.push_back('b');
                    b--; bcount++;
                    acount = 0;
                }   
                else if(a > 0 && acount < 2){
                    ans.push_back('a');
                    a--; acount++;
                    bcount = 0;
                }
                i++;
            }

            else{
                if(a > 0 && acount < 2){
                    ans.push_back('a');
                    a--; acount++;
                    bcount = 0;
                }
                else if(bcount < 2 && b > 0){
                    ans.push_back('b');
                    b--; bcount++;
                    acount = 0;
                }
                i++;
            }
        }

        return ans;
    }
};
7500