feat: add solutions to lc problem: No.2740 (doocs#3274)

No.2740.Find the Value of the Partition

Author: yanglbme

solution/2700-2799/2740.Find the Value of the Partition/README.md

@@ -135,6 +135,34 @@ func findValueOfPartition(nums []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function findValueOfPartition(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    let ans = Infinity;
+    for (let i = 1; i < nums.length; ++i) {
+        ans = Math.min(ans, Math.abs(nums[i] - nums[i - 1]));
+    }
+    return ans;
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_value_of_partition(mut nums: Vec<i32>) -> i32 {
+        nums.sort();
+        let mut ans = i32::MAX;
+        for i in 1..nums.len() {
+            ans = ans.min(nums[i] - nums[i - 1]);
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2700-2799/2740.Find the Value of the Partition/README_EN.md

@@ -135,6 +135,34 @@ func findValueOfPartition(nums []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function findValueOfPartition(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    let ans = Infinity;
+    for (let i = 1; i < nums.length; ++i) {
+        ans = Math.min(ans, Math.abs(nums[i] - nums[i - 1]));
+    }
+    return ans;
+}
+```
+
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_value_of_partition(mut nums: Vec<i32>) -> i32 {
+        nums.sort();
+        let mut ans = i32::MAX;
+        for i in 1..nums.len() {
+            ans = ans.min(nums[i] - nums[i - 1]);
+        }
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2700-2799/2740.Find the Value of the Partition/Solution.rs

@@ -0,0 +1,10 @@
+impl Solution {
+    pub fn find_value_of_partition(mut nums: Vec<i32>) -> i32 {
+        nums.sort();
+        let mut ans = i32::MAX;
+        for i in 1..nums.len() {
+            ans = ans.min(nums[i] - nums[i - 1]);
+        }
+        ans
+    }
+}

solution/2700-2799/2740.Find the Value of the Partition/Solution.ts

@@ -0,0 +1,8 @@
+function findValueOfPartition(nums: number[]): number {
+    nums.sort((a, b) => a - b);
+    let ans = Infinity;
+    for (let i = 1; i < nums.length; ++i) {
+        ans = Math.min(ans, Math.abs(nums[i] - nums[i - 1]));
+    }
+    return ans;
+}