feat: add leetcode solutions: No.0709. To Lower Case

Author: yanglbme

index.html

@@ -47,7 +47,7 @@
         dark: {
           background: 'rgb(28,32,34)',
           highlightColor: '#e96900',
-          codeBackgroudColor: 'rgb(34,39,46)',
+          codeBackgroundColor: 'rgb(34,39,46)',
           codeTextColor: '#b4b4b4',
         },
         light: {

solution/0700-0799/0709.To Lower Case/README.md

@@ -32,22 +32,46 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+遍历字符串，遇到大写的字符，转小写。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def toLowerCase(self, str: str) -> str:
+        if not str:
+            return str
+        n = len(str)
+        res = []
+        for i in range(n):
+            c = ord(str[i])
+            if c >= 65 and c <= 90:
+               c += 32
+            res.append(chr(c))
+        return ''.join(res)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String toLowerCase(String str) {
+        int n;
+        if (str == null || (n = str.length()) == 0) return str;
+        char[] chars = str.toCharArray();
+        for (int i = 0; i < chars.length; ++i) {
+            boolean isUpper = chars[i] >= 'A' && chars[i] <= 'Z';
+            if (isUpper) chars[i] += 32;
+        }
+        return new String(chars);
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0709.To Lower Case/README_EN.md

@@ -57,13 +57,35 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def toLowerCase(self, str: str) -> str:
+        if not str:
+            return str
+        n = len(str)
+        res = []
+        for i in range(n):
+            c = ord(str[i])
+            if c >= 65 and c <= 90:
+               c += 32
+            res.append(chr(c))
+        return ''.join(res)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public String toLowerCase(String str) {
+        int n;
+        if (str == null || (n = str.length()) == 0) return str;
+        char[] chars = str.toCharArray();
+        for (int i = 0; i < chars.length; ++i) {
+            boolean isUpper = chars[i] >= 'A' && chars[i] <= 'Z';
+            if (isUpper) chars[i] += 32;
+        }
+        return new String(chars);
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0709.To Lower Case/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public String toLowerCase(String str) {
+        int n;
+        if (str == null || (n = str.length()) == 0) return str;
+        char[] chars = str.toCharArray();
+        for (int i = 0; i < chars.length; ++i) {
+            boolean isUpper = chars[i] >= 'A' && chars[i] <= 'Z';
+            if (isUpper) chars[i] += 32;
+        }
+        return new String(chars);
+    }
+}

solution/0700-0799/0709.To Lower Case/Solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def toLowerCase(self, str: str) -> str:
+        if not str:
+            return str
+        n = len(str)
+        res = []
+        for i in range(n):
+            c = ord(str[i])
+            if c >= 65 and c <= 90:
+               c += 32
+            res.append(chr(c))
+        return ''.join(res)