题目:原题链接(简单)
标签:字符串
解法时间复杂度空间复杂度执行用时Ans 1 (Python) O ( N ) O(N) O(N) O ( 1 ) O(1) O(1)36ms (84.28%)Ans 2 (Python) O ( N ) O(N) O(N) O ( 1 ) O(1) O(1)40ms (63.45%)Ans 3 (Python)LeetCode的Python执行用时随缘,只要时间复杂度没有明显差异,执行用时一般都在同一个量级,仅作参考意义。
解法一:
def toLowerCase(self, str: str) -> str: return str.lower()解法二:
def toLowerCase(self, str: str) -> str: ans = "" for n in str: a = ord(n) if 65 <= ord(n) <= 90: ans += chr(a + 32) else: ans += n return ans