Leetcode 984. String without AAA or BBB (thought of netizens)

Given two integers a and b , return arbitrarily character string s , Demand satisfaction ：

• s The length of is a + b, And contains exactly a individual ‘a’ Letters and b individual ‘b’ Letter ;
• Substring ‘aaa’ Not in s in ;
• Substring ‘bbb’ Not in s in .

Example 1：

 Input ：a = 1, b = 2
 Output ："abb"
 explain ："abb", "bab"  and  "bba"  It's all the right answers .

Example 2：

 Input ：a = 4, b = 1
 Output ："aabaa"
 

Tips ：

• 0 <= a, b <= 100
• For a given a and b, Ensure that there are s

Code:

class Solution {
    
public:
   string strWithout3a3b(int A, int B) {
    
    // Guarantee A > B
    string str = "";
    char a = 'a', b = 'b';
    if (A < B) {
    
        swap(A, B);
        swap(a, b);
    }
    while (A > 0 || B > 0) {
    
        if (A > 0) {
    
            str.push_back(a);
            A --;
        }
        if (A > B) {
    
            str.push_back(a);
            A --;
        }
        if (B > 0) {
    
            str.push_back(b);
            B --;
        }
    }
    return str;
}
   
};