@@ -0,0 +1,10 @@ | |||
class Solution: | |||
def generateTheString(self, n: int) -> str: | |||
if n % 2 == 0: | |||
return ('a' * (n -1)) + 'b' | |||
else: | |||
return 'a' * n | |||
s = Solution() | |||
print("Expected: 'aaab'") | |||
print("Got:", s.generateTheString(4)) |
@@ -0,0 +1,3 @@ | |||
Given an integer n, return a string with n characters such that each character in such string occurs an odd number of times. | |||
The returned string must contain only lowercase English letters. If there are multiples valid strings, return any of them. |
@@ -0,0 +1,3 @@ | |||
#!/bin/bash | |||
python3 main.py |