human
Write me a the Python code you requested given the following:
Solve in Python:
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.
assistant
#Here is the Python code you requested.

class Solution:
    def strWithout3a3b(self, A: int, B: int) -> str:
        count = [A, B]
        char = ['aab', 'bba']
        for i in range(2):
            j = i ^ 1
            if count[i] >= count[j]:
                if count[i] >= count[j] * 2:
                    return char[i] * count[j] + char[i][:1] * (count[i] - count[j]*2)
                return char[i] * (count[i] - count[j]) + char[i][1:] * (count[j]*2 - count[i])