Skip to content

Commit 4f95623

Browse files
committed
feat: add solutions to lc problem: No.1450
No.1450.Number of Students Doing Homework at a Given Time
1 parent baf77c7 commit 4f95623

File tree

5 files changed

+132
-0
lines changed

5 files changed

+132
-0
lines changed

solution/1400-1499/1450.Number of Students Doing Homework at a Given Time/README.md

+49
Original file line numberDiff line numberDiff line change
@@ -217,6 +217,55 @@ func busyStudent(startTime []int, endTime []int, queryTime int) int {
217217
}
218218
```
219219

220+
### **C**
221+
222+
```c
223+
int busyStudent(int* startTime, int startTimeSize, int* endTime, int endTimeSize, int queryTime) {
224+
int res = 0;
225+
for (int i = 0; i < startTimeSize; i++) {
226+
if (startTime[i] <= queryTime && endTime[i] >= queryTime) {
227+
res++;
228+
}
229+
}
230+
return res;
231+
}
232+
```
233+
234+
### **TypeScript**
235+
236+
```ts
237+
function busyStudent(
238+
startTime: number[],
239+
endTime: number[],
240+
queryTime: number,
241+
): number {
242+
const n = startTime.length;
243+
let res = 0;
244+
for (let i = 0; i < n; i++) {
245+
if (startTime[i] <= queryTime && endTime[i] >= queryTime) {
246+
res++;
247+
}
248+
}
249+
return res;
250+
}
251+
```
252+
253+
### **Rust**
254+
255+
```rust
256+
impl Solution {
257+
pub fn busy_student(start_time: Vec<i32>, end_time: Vec<i32>, query_time: i32) -> i32 {
258+
let mut res = 0;
259+
for i in 0..start_time.len() {
260+
if start_time[i] <= query_time && end_time[i] >= query_time {
261+
res += 1;
262+
}
263+
}
264+
res
265+
}
266+
}
267+
```
268+
220269
### **...**
221270

222271
```

solution/1400-1499/1450.Number of Students Doing Homework at a Given Time/README_EN.md

+49
Original file line numberDiff line numberDiff line change
@@ -161,6 +161,55 @@ func busyStudent(startTime []int, endTime []int, queryTime int) int {
161161
}
162162
```
163163

164+
### **C**
165+
166+
```c
167+
int busyStudent(int* startTime, int startTimeSize, int* endTime, int endTimeSize, int queryTime) {
168+
int res = 0;
169+
for (int i = 0; i < startTimeSize; i++) {
170+
if (startTime[i] <= queryTime && endTime[i] >= queryTime) {
171+
res++;
172+
}
173+
}
174+
return res;
175+
}
176+
```
177+
178+
### **TypeScript**
179+
180+
```ts
181+
function busyStudent(
182+
startTime: number[],
183+
endTime: number[],
184+
queryTime: number,
185+
): number {
186+
const n = startTime.length;
187+
let res = 0;
188+
for (let i = 0; i < n; i++) {
189+
if (startTime[i] <= queryTime && endTime[i] >= queryTime) {
190+
res++;
191+
}
192+
}
193+
return res;
194+
}
195+
```
196+
197+
### **Rust**
198+
199+
```rust
200+
impl Solution {
201+
pub fn busy_student(start_time: Vec<i32>, end_time: Vec<i32>, query_time: i32) -> i32 {
202+
let mut res = 0;
203+
for i in 0..start_time.len() {
204+
if start_time[i] <= query_time && end_time[i] >= query_time {
205+
res += 1;
206+
}
207+
}
208+
res
209+
}
210+
}
211+
```
212+
164213
### **...**
165214

166215
```
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
int busyStudent(int* startTime, int startTimeSize, int* endTime, int endTimeSize, int queryTime) {
2+
int res = 0;
3+
for (int i = 0; i < startTimeSize; i++) {
4+
if (startTime[i] <= queryTime && endTime[i] >= queryTime) {
5+
res++;
6+
}
7+
}
8+
return res;
9+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
impl Solution {
2+
pub fn busy_student(start_time: Vec<i32>, end_time: Vec<i32>, query_time: i32) -> i32 {
3+
let mut res = 0;
4+
for i in 0..start_time.len() {
5+
if start_time[i] <= query_time && end_time[i] >= query_time {
6+
res += 1;
7+
}
8+
}
9+
res
10+
}
11+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
function busyStudent(
2+
startTime: number[],
3+
endTime: number[],
4+
queryTime: number,
5+
): number {
6+
const n = startTime.length;
7+
let res = 0;
8+
for (let i = 0; i < n; i++) {
9+
if (startTime[i] <= queryTime && endTime[i] >= queryTime) {
10+
res++;
11+
}
12+
}
13+
return res;
14+
}

0 commit comments

Comments
 (0)