feat: add solutions to lc problem: No.3423

solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README.md

@@ -76,7 +76,7 @@ tags:
 ```python
 class Solution:
     def maxAdjacentDistance(self, nums: List[int]) -> int:
-        return max(max(abs(a - b) for a, b in pairwise(nums)), abs(nums[0] - nums[-1]))
+        return max(abs(a - b) for a, b in pairwise(nums + [nums[0]]))
 ```
 
 #### Java
@@ -141,6 +141,36 @@ function maxAdjacentDistance(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn max_adjacent_distance(nums: Vec<i32>) -> i32 {
+        nums.iter()
+            .zip(nums.iter().cycle().skip(1))
+            .take(nums.len())
+            .map(|(a, b)| (*a - *b).abs())
+            .max()
+            .unwrap_or(0)
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int MaxAdjacentDistance(int[] nums) {
+        int n = nums.Length;
+        int ans = Math.Abs(nums[0] - nums[n - 1]);
+        for (int i = 1; i < n; ++i) {
+            ans = Math.Max(ans, Math.Abs(nums[i] - nums[i - 1]));
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README_EN.md

@@ -74,7 +74,7 @@ The time complexity is $O(n)$, where $n$ is the length of the array $\textit{num
 ```python
 class Solution:
     def maxAdjacentDistance(self, nums: List[int]) -> int:
-        return max(max(abs(a - b) for a, b in pairwise(nums)), abs(nums[0] - nums[-1]))
+        return max(abs(a - b) for a, b in pairwise(nums + [nums[0]]))
 ```
 
 #### Java
@@ -139,6 +139,36 @@ function maxAdjacentDistance(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn max_adjacent_distance(nums: Vec<i32>) -> i32 {
+        nums.iter()
+            .zip(nums.iter().cycle().skip(1))
+            .take(nums.len())
+            .map(|(a, b)| (*a - *b).abs())
+            .max()
+            .unwrap_or(0)
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int MaxAdjacentDistance(int[] nums) {
+        int n = nums.Length;
+        int ans = Math.Abs(nums[0] - nums[n - 1]);
+        for (int i = 1; i < n; ++i) {
+            ans = Math.Max(ans, Math.Abs(nums[i] - nums[i - 1]));
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/Solution.cs

@@ -0,0 +1,10 @@
+public class Solution {
+    public int MaxAdjacentDistance(int[] nums) {
+        int n = nums.Length;
+        int ans = Math.Abs(nums[0] - nums[n - 1]);
+        for (int i = 1; i < n; ++i) {
+            ans = Math.Max(ans, Math.Abs(nums[i] - nums[i - 1]));
+        }
+        return ans;
+    }
+}

solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/Solution.py

@@ -1,3 +1,3 @@
 class Solution:
     def maxAdjacentDistance(self, nums: List[int]) -> int:
-        return max(max(abs(a - b) for a, b in pairwise(nums)), abs(nums[0] - nums[-1]))
+        return max(abs(a - b) for a, b in pairwise(nums + [nums[0]]))

solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/Solution.rs

@@ -0,0 +1,10 @@
+impl Solution {
+    pub fn max_adjacent_distance(nums: Vec<i32>) -> i32 {
+        nums.iter()
+            .zip(nums.iter().cycle().skip(1))
+            .take(nums.len())
+            .map(|(a, b)| (*a - *b).abs())
+            .max()
+            .unwrap_or(0)
+    }
+}