leetcode 984字符串贪心

题目：
Given two integers A and B, return any string S such that:

S has length A + B and contains exactly A ‘a’ letters, and exactly B ‘b’ letters;
The substring ‘aaa’ does not occur in S;
The substring ‘bbb’ does not occur in S.

Example 1:

Input: A = 1, B = 2
Output: “abb”
Explanation: “abb”, “bab” and “bba” are all correct answers.
Example 2:

Input: A = 4, B = 1
Output: “aabaa”

Note:

0 <= A <= 100
0 <= B <= 100
It is guaranteed such an S exists for the given A and B.
思路：
当A的长度比B的小的时候，交换A和B，并且交换字母
当A大于等于B的两倍的时候,前面全是aab的形式，直到最后用2个或者一个a进行填补
当A大于等于B但是小于B的两倍的时候,前面全是aab的形式（重复A-B次），然后后面就变成ab重复2*B-A次
代码：
python 版：
def strWithout3a3b(self, A, B, a = “a”, b = “b”):
if B > A: return self.strWithout3a3b(B, A, b, a)
if A >= B * 2: return (a + a + b) * B + a * (A - B * 2)
return (a + a + b) * (A - B) + (a + b) * (B * 2 - A)
c++版:
string strWithout3a3b(int A, int B, char a = ‘a’, char b = ‘b’) {
if (B > A) return strWithout3a3b(B, A, b, a);
if (B == 0) return string(A, a);
return string(A > B ? 2 : 1, a) + b + strWithout3a3b(A - (A > B ? 2 : 1), B - 1, a, b);
}