Skip to content

Commit ddeffd7

Browse files
committed
feat: add solutions to lc problems: No.0121
No.0121.Best Time to Buy and Sell Stock
1 parent 5f2db72 commit ddeffd7

File tree

4 files changed

+80
-0
lines changed

4 files changed

+80
-0
lines changed

solution/0100-0199/0121.Best Time to Buy and Sell Stock/README.md

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -154,6 +154,36 @@ public class Solution {
154154
}
155155
```
156156

157+
### **TypeScript**
158+
159+
```ts
160+
function maxProfit(prices: number[]): number {
161+
let res = 0;
162+
let min = Infinity;
163+
for (const price of prices) {
164+
res = Math.max(res, price - min);
165+
min = Math.min(min, price);
166+
}
167+
return res;
168+
}
169+
```
170+
171+
### **Rust**
172+
173+
```rust
174+
impl Solution {
175+
pub fn max_profit(prices: Vec<i32>) -> i32 {
176+
let mut res = 0;
177+
let mut min = i32::MAX;
178+
for price in prices {
179+
res = res.max(price - min);
180+
min = min.min(price);
181+
}
182+
res
183+
}
184+
}
185+
```
186+
157187
### **...**
158188

159189
```

solution/0100-0199/0121.Best Time to Buy and Sell Stock/README_EN.md

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -144,6 +144,36 @@ public class Solution {
144144
}
145145
```
146146

147+
### **TypeScript**
148+
149+
```ts
150+
function maxProfit(prices: number[]): number {
151+
let res = 0;
152+
let min = Infinity;
153+
for (const price of prices) {
154+
res = Math.max(res, price - min);
155+
min = Math.min(min, price);
156+
}
157+
return res;
158+
}
159+
```
160+
161+
### **Rust**
162+
163+
```rust
164+
impl Solution {
165+
pub fn max_profit(prices: Vec<i32>) -> i32 {
166+
let mut res = 0;
167+
let mut min = i32::MAX;
168+
for price in prices {
169+
res = res.max(price - min);
170+
min = min.min(price);
171+
}
172+
res
173+
}
174+
}
175+
```
176+
147177
### **...**
148178

149179
```
Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
impl Solution {
2+
pub fn max_profit(prices: Vec<i32>) -> i32 {
3+
let mut res = 0;
4+
let mut min = i32::MAX;
5+
for price in prices {
6+
res = res.max(price - min);
7+
min = min.min(price);
8+
}
9+
res
10+
}
11+
}
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
function maxProfit(prices: number[]): number {
2+
let res = 0;
3+
let min = Infinity;
4+
for (const price of prices) {
5+
res = Math.max(res, price - min);
6+
min = Math.min(min, price);
7+
}
8+
return res;
9+
}

0 commit comments

Comments
 (0)