<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;
        if(a==b)
        {
            for(int i=0; i<a+b; i++)
            {
                if(i%2)
                    ans=ans+ "a";
                else ans=ans+"b";
            }   
            return ans;
        }
        else if(a>b)
        {
            int i=a, j=b;
            while(i>0 and j>0 and i>j)
            {
                ans= ans+"aa";
                i-=2;
                ans= ans+"b";
                j--;
            }
            while(i>0 and j>0)
            {
                ans= ans+"a";
                i-=1;
                ans= ans+"b";
                j--;
            }
            if(i>0)
            {
                while(i)
                {
                    ans= ans+"a";
                    i--;
                }
            }
            if(j>0)
            {
                while(j)
                {
                    ans =ans+ "b";
                    j--;
                }
            }
            return ans;
        }
        int i=a, j=b;
            while(i>0 and j>0 and j>i)
            {
                ans= ans+"bb";
                j-=2;
                ans= ans+"a";
                i--;
            }
            while(i>0 and j>0)
            {
                ans= ans+"b";
                j-=1;
                ans= ans+"a";
                i--;
            }
            if(i>0)
            {
                while(i)
                {
                    ans= ans+"a";
                    i--;
                }
            }
            if(j>0)
            {
                while(j)
                {
                    ans =ans+ "b";
                    j--;
                }
            }
        return ans;
    }
};
9300