Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 984 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 984 # by problem number
lcpy gen -s string_without_aaa_or_bbb # by problem name
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,'aaa' does not occur in s, and'bbb' does not occur in s.Input: a = 1, b = 2
Output: "abb"
Explanation: "abb", "bab" and "bba" are all correct answers.
Input: a = 4, b = 1
Output: "aabaa"
0 <= a, b <= 100s exists for the given a and b.class Solution:
# Time: O(a + b)
# Space: O(a + b)
def str_without3a3b(self, a: int, b: int) -> str:
result: list[str] = []
while a > 0 or b > 0:
# Two identical letters in a row: the other letter is forced.
# Otherwise extend with the letter that is still more plentiful
forced = len(result) >= 2 and result[-1] == result[-2]
write_a = result[-1] == "b" if forced else a >= b
if write_a:
result.append("a")
a -= 1
else:
result.append("b")
b -= 1
return "".join(result)
| Time | Space |
|---|---|
| O(a + b) | O(a + b) |