feat: add solutions to lc problems: No.709,1309

YangFong · YangFong · commit 7455b0082ecc · 2022-04-11T11:10:20.000+08:00
- No.0709.To Lower Case
- No.1309.Decrypt String from Alphabet to Integer Mapping
diff --git a/solution/0700-0799/0709.To Lower Case/README.md b/solution/0700-0799/0709.To Lower Case/README.md
@@ -106,6 +106,30 @@ func toLowerCase(s string) string {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn to_lower_case(s: String) -> String {
+        s.to_ascii_lowercase()
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn to_lower_case(s: String) -> String {
+        String::from_utf8(
+            s.as_bytes()
+                .iter()
+                .map(|&c| c + if c >= b'A' && c <= b'Z' { 32 } else { 0 })
+                .collect(),
+        )
+        .unwrap()
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0700-0799/0709.To Lower Case/README_EN.md b/solution/0700-0799/0709.To Lower Case/README_EN.md
@@ -94,6 +94,30 @@ func toLowerCase(s string) string {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn to_lower_case(s: String) -> String {
+        s.to_ascii_lowercase()
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn to_lower_case(s: String) -> String {
+        String::from_utf8(
+            s.as_bytes()
+                .iter()
+                .map(|&c| c + if c >= b'A' && c <= b'Z' { 32 } else { 0 })
+                .collect(),
+        )
+        .unwrap()
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/0700-0799/0709.To Lower Case/Solution.rs b/solution/0700-0799/0709.To Lower Case/Solution.rs
@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn to_lower_case(s: String) -> String {
+        String::from_utf8(
+            s.as_bytes()
+                .iter()
+                .map(|&c| c + if c >= b'A' && c <= b'Z' { 32 } else { 0 })
+                .collect(),
+        )
+        .unwrap()
+    }
+}
diff --git a/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/README.md b/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/README.md
@@ -109,6 +109,53 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function freqAlphabets(s: string): string {
+    const n = s.length;
+    const res = [];
+    let i = 0;
+    while (i < n) {
+        let code: string;
+        if (s[i + 2] === '#') {
+            code = s.slice(i, i + 2);
+            i += 3;
+        } else {
+            code = s[i];
+            i += 1;
+        }
+        res.push(code);
+    }
+    return res.map(v => String.fromCharCode(96 + Number(v))).join('');
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn freq_alphabets(s: String) -> String {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = String::new();
+        let mut i = 0;
+        while i < n {
+            let code: u8;
+            if s.get(i + 2).is_some() && s[i + 2] == b'#' {
+                code = (s[i] - b'0') * 10 + s[i + 1];
+                i += 3;
+            } else {
+                code = s[i];
+                i += 1;
+            }
+            res.push(char::from(97 + code - b'1'));
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/README_EN.md b/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/README_EN.md
@@ -89,6 +89,53 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function freqAlphabets(s: string): string {
+    const n = s.length;
+    const res = [];
+    let i = 0;
+    while (i < n) {
+        let code: string;
+        if (s[i + 2] === '#') {
+            code = s.slice(i, i + 2);
+            i += 3;
+        } else {
+            code = s[i];
+            i += 1;
+        }
+        res.push(code);
+    }
+    return res.map(v => String.fromCharCode(96 + Number(v))).join('');
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn freq_alphabets(s: String) -> String {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = String::new();
+        let mut i = 0;
+        while i < n {
+            let code: u8;
+            if s.get(i + 2).is_some() && s[i + 2] == b'#' {
+                code = (s[i] - b'0') * 10 + s[i + 1];
+                i += 3;
+            } else {
+                code = s[i];
+                i += 1;
+            }
+            res.push(char::from(97 + code - b'1'));
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/Solution.rs b/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/Solution.rs
@@ -0,0 +1,20 @@
+impl Solution {
+    pub fn freq_alphabets(s: String) -> String {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = String::new();
+        let mut i = 0;
+        while i < n {
+            let code: u8;
+            if s.get(i + 2).is_some() && s[i + 2] == b'#' {
+                code = (s[i] - b'0') * 10 + s[i + 1];
+                i += 3;
+            } else {
+                code = s[i];
+                i += 1;
+            }
+            res.push(char::from(97 + code - b'1'));
+        }
+        res
+    }
+}
diff --git a/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/Solution.ts b/solution/1300-1399/1309.Decrypt String from Alphabet to Integer Mapping/Solution.ts
@@ -0,0 +1,17 @@
+function freqAlphabets(s: string): string {
+    const n = s.length;
+    const res = [];
+    let i = 0;
+    while (i < n) {
+        let code: string;
+        if (s[i + 2] === '#') {
+            code = s.slice(i, i + 2);
+            i += 3;
+        } else {
+            code = s[i];
+            i += 1;
+        }
+        res.push(code);
+    }
+    return res.map(v => String.fromCharCode(96 + Number(v))).join('');
+}
