Skip to content

Commit cc1daac

Browse files
committed
feat: add rust solution to lc problem: No.1984
No.1984.Minimum Difference Between Highest and Lowest of K Scores
1 parent 3bf4b25 commit cc1daac

File tree

3 files changed

+43
-0
lines changed

3 files changed

+43
-0
lines changed

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/README.md

+16
Original file line numberDiff line numberDiff line change
@@ -129,6 +129,22 @@ func min(a, b int) int {
129129
}
130130
```
131131

132+
### **Rust**
133+
134+
```rust
135+
impl Solution {
136+
pub fn minimum_difference(mut nums: Vec<i32>, k: i32) -> i32 {
137+
nums.sort();
138+
let k = k as usize;
139+
let mut res = i32::MAX;
140+
for i in 0..=nums.len() - k {
141+
res = res.min(nums[i + k - 1] - nums[i]);
142+
}
143+
res
144+
}
145+
}
146+
```
147+
132148
### **...**
133149

134150
```

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/README_EN.md

+16
Original file line numberDiff line numberDiff line change
@@ -120,6 +120,22 @@ func min(a, b int) int {
120120
}
121121
```
122122

123+
### **Rust**
124+
125+
```rust
126+
impl Solution {
127+
pub fn minimum_difference(mut nums: Vec<i32>, k: i32) -> i32 {
128+
nums.sort();
129+
let k = k as usize;
130+
let mut res = i32::MAX;
131+
for i in 0..=nums.len() - k {
132+
res = res.min(nums[i + k - 1] - nums[i]);
133+
}
134+
res
135+
}
136+
}
137+
```
138+
123139
### **...**
124140

125141
```
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
impl Solution {
2+
pub fn minimum_difference(mut nums: Vec<i32>, k: i32) -> i32 {
3+
nums.sort();
4+
let k = k as usize;
5+
let mut res = i32::MAX;
6+
for i in 0..=nums.len() - k {
7+
res = res.min(nums[i + k - 1] - nums[i]);
8+
}
9+
res
10+
}
11+
}

0 commit comments

Comments
 (0)