Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit fd5a44c

Browse files
committed
feat: feat: add rust solution to lc problem: No.0153
No.0153.Find Minimum in Rotated Sorted Array
1 parent 9de213a commit fd5a44c

File tree

3 files changed

+55
-0
lines changed

3 files changed

+55
-0
lines changed

‎solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README.md‎

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -162,6 +162,26 @@ var findMin = function (nums) {
162162
};
163163
```
164164

165+
### **Rust**
166+
167+
```rust
168+
impl Solution {
169+
pub fn find_min(nums: Vec<i32>) -> i32 {
170+
let mut l = 0;
171+
let mut r = nums.len() - 1;
172+
while l < r {
173+
let mid = l + (r - l) / 2;
174+
if nums[mid] > nums[r] {
175+
l = mid + 1;
176+
} else {
177+
r = mid;
178+
}
179+
}
180+
nums[l]
181+
}
182+
}
183+
```
184+
165185
### **...**
166186

167187
```

‎solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README_EN.md‎

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -147,6 +147,26 @@ var findMin = function (nums) {
147147
};
148148
```
149149

150+
### **Rust**
151+
152+
```rust
153+
impl Solution {
154+
pub fn find_min(nums: Vec<i32>) -> i32 {
155+
let mut l = 0;
156+
let mut r = nums.len() - 1;
157+
while l < r {
158+
let mid = l + (r - l) / 2;
159+
if nums[mid] > nums[r] {
160+
l = mid + 1;
161+
} else {
162+
r = mid;
163+
}
164+
}
165+
nums[l]
166+
}
167+
}
168+
```
169+
150170
### **...**
151171

152172
```
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
impl Solution {
2+
pub fn find_min(nums: Vec<i32>) -> i32 {
3+
let mut l = 0;
4+
let mut r = nums.len() - 1;
5+
while l < r {
6+
let mid = l + (r - l) / 2;
7+
if nums[mid] > nums[r] {
8+
l = mid + 1;
9+
} else {
10+
r = mid;
11+
}
12+
}
13+
nums[l]
14+
}
15+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /