feat: add solutions to lc problems: No.2413~2416

- No.2413.Smallest Even Multiple
- No.2414.Length of the Longest Alphabetical Continuous Substring
- No.2415.Reverse Odd Levels of Binary Tree
- No.2416.Sum of Prefix Scores of Strings

Author: YangFong

solution/2400-2499/2413.Smallest Even Multiple/README.md

@@ -88,17 +88,39 @@ func smallestEvenMultiple(n int) int {
 }
 ```
 
+### **C**
+
+```c
+int smallestEvenMultiple(int n) {
+    return n % 2 == 0 ? n : n * 2;
+}
+```
+
 ### **TypeScript**
 
 ```ts
+function smallestEvenMultiple(n: number): number {
+    return n % 2 === 0 ? n : n * 2;
+}
+```
+
+### **Rust**
 
+```rust
+impl Solution {
+    pub fn smallest_even_multiple(n: i32) -> i32 {
+        if n % 2 == 0 {
+            return n;
+        }
+        n * 2
+    }
+}
 ```
 
 ### **...**
 
 ```
 
-
 ```
 
 <!-- tabs:end -->

solution/2400-2499/2413.Smallest Even Multiple/README_EN.md

@@ -74,17 +74,39 @@ func smallestEvenMultiple(n int) int {
 }
 ```
 
+### **C**
+
+```c
+int smallestEvenMultiple(int n) {
+    return n % 2 == 0 ? n : n * 2;
+}
+```
+
 ### **TypeScript**
 
 ```ts
+function smallestEvenMultiple(n: number): number {
+    return n % 2 === 0 ? n : n * 2;
+}
+```
+
+### **Rust**
 
+```rust
+impl Solution {
+    pub fn smallest_even_multiple(n: i32) -> i32 {
+        if n % 2 == 0 {
+            return n;
+        }
+        n * 2
+    }
+}
 ```
 
 ### **...**
 
 ```
 
-
 ```
 
 <!-- tabs:end -->

solution/2400-2499/2413.Smallest Even Multiple/Solution.c

@@ -0,0 +1,3 @@
+int smallestEvenMultiple(int n) {
+    return n % 2 == 0 ? n : n * 2;
+}

solution/2400-2499/2413.Smallest Even Multiple/Solution.rs

@@ -0,0 +1,8 @@
+impl Solution {
+    pub fn smallest_even_multiple(n: i32) -> i32 {
+        if n % 2 == 0 {
+            return n;
+        }
+        n * 2
+    }
+}

solution/2400-2499/2413.Smallest Even Multiple/Solution.ts

@@ -0,0 +1,3 @@
+function smallestEvenMultiple(n: number): number {
+    return n % 2 === 0 ? n : n * 2;
+}

solution/2400-2499/2414.Length of the Longest Alphabetical Continuous Substring/README.md

@@ -134,17 +134,66 @@ func max(a, b int) int {
 }
 ```
 
+### **C**
+
+```c
+#define max(a,b) (((a) > (b)) ? (a) : (b))
+
+int longestContinuousSubstring(char *s) {
+    int n = strlen(s);
+    int i = 0;
+    int res = 1;
+    for (int j = 1; j < n; j++) {
+        if (s[j] - s[j - 1] != 1) {
+            res = max(res, j - i);
+            i = j;
+        }
+    }
+    return max(res, n - i);
+}
+```
+
 ### **TypeScript**
 
 ```ts
+function longestContinuousSubstring(s: string): number {
+    const n = s.length;
+    let res = 1;
+    let i = 0;
+    for (let j = 1; j < n; j++) {
+        if (s[j].charCodeAt(0) - s[j - 1].charCodeAt(0) !== 1) {
+            res = Math.max(res, j - i);
+            i = j;
+        }
+    }
+    return Math.max(res, n - i);
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn longest_continuous_substring(s: String) -> i32 {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = 1;
+        let mut i = 0;
+        for j in 1..n {
+            if s[j] - s[j - 1] != 1 {
+                res = res.max(j - i);
+                i = j;
+            }
+        }
+        res.max(n - i) as i32
+    }
+}
 ```
 
 ### **...**
 
 ```
 
-
 ```
 
 <!-- tabs:end -->

solution/2400-2499/2414.Length of the Longest Alphabetical Continuous Substring/README_EN.md

@@ -121,17 +121,66 @@ func max(a, b int) int {
 }
 ```
 
+### **C**
+
+```c
+#define max(a,b) (((a) > (b)) ? (a) : (b))
+
+int longestContinuousSubstring(char *s) {
+    int n = strlen(s);
+    int i = 0;
+    int res = 1;
+    for (int j = 1; j < n; j++) {
+        if (s[j] - s[j - 1] != 1) {
+            res = max(res, j - i);
+            i = j;
+        }
+    }
+    return max(res, n - i);
+}
+```
+
 ### **TypeScript**
 
 ```ts
+function longestContinuousSubstring(s: string): number {
+    const n = s.length;
+    let res = 1;
+    let i = 0;
+    for (let j = 1; j < n; j++) {
+        if (s[j].charCodeAt(0) - s[j - 1].charCodeAt(0) !== 1) {
+            res = Math.max(res, j - i);
+            i = j;
+        }
+    }
+    return Math.max(res, n - i);
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn longest_continuous_substring(s: String) -> i32 {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = 1;
+        let mut i = 0;
+        for j in 1..n {
+            if s[j] - s[j - 1] != 1 {
+                res = res.max(j - i);
+                i = j;
+            }
+        }
+        res.max(n - i) as i32
+    }
+}
 ```
 
 ### **...**
 
 ```
 
-
 ```
 
 <!-- tabs:end -->

solution/2400-2499/2414.Length of the Longest Alphabetical Continuous Substring/Solution.c

@@ -0,0 +1,14 @@
+#define max(a,b) (((a) > (b)) ? (a) : (b))
+
+int longestContinuousSubstring(char *s) {
+    int n = strlen(s);
+    int i = 0;
+    int res = 1;
+    for (int j = 1; j < n; j++) {
+        if (s[j] - s[j - 1] != 1) {
+            res = max(res, j - i);
+            i = j;
+        }
+    }
+    return max(res, n - i);
+}

solution/2400-2499/2414.Length of the Longest Alphabetical Continuous Substring/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn longest_continuous_substring(s: String) -> i32 {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = 1;
+        let mut i = 0;
+        for j in 1..n {
+            if s[j] - s[j - 1] != 1 {
+                res = res.max(j - i);
+                i = j;
+            }
+        }
+        res.max(n - i) as i32
+    }
+}

solution/2400-2499/2414.Length of the Longest Alphabetical Continuous Substring/Solution.ts

@@ -0,0 +1,12 @@
+function longestContinuousSubstring(s: string): number {
+    const n = s.length;
+    let res = 1;
+    let i = 0;
+    for (let j = 1; j < n; j++) {
+        if (s[j].charCodeAt(0) - s[j - 1].charCodeAt(0) !== 1) {
+            res = Math.max(res, j - i);
+            i = j;
+        }
+    }
+    return Math.max(res, n - i);
+}