[leetcode] 1450. Number of Students Doing Homework at a Given Time-CSDN博客

本文链接：https://blog.csdn.net/w5688414/article/details/108956364

该博客介绍了LeetCode上的一道简单算法题，目标是计算在特定queryTime时刻有多少学生正在做作业。题目给出学生开始和结束做作业的时间数组，通过遍历数组并判断queryTime是否在每个时间段内来计算结果。代码实现了一个名为`busyStudent`的函数，该函数返回在queryTime时做作业的学生数。示例展示了不同输入和输出情况。

摘要由CSDN通过智能技术生成

Description

Given two integer arrays startTime and endTime and given an integer queryTime.

The ith student started doing their homework at the time startTime[i] and finished it at time endTime[i].

Return the number of students doing their homework at time queryTime. More formally, return the number of students where queryTime lays in the interval [startTime[i], endTime[i]] inclusive.

Example 1:

Input: startTime = [1,2,3], endTime = [3,2,7], queryTime = 4
Output: 1
Explanation: We have 3 students where:
The first student started doing homework at time 1 and finished at time 3 and wasn't doing anything at time 4.
The second student started doing homework at time 2 and finished at time 2 and also wasn't doing anything at time 4.
The third student started doing homework at time 3 and finished at time 7 and was the only student doing homework at time 4.

Example 2:

Input: startTime = [4], endTime = [4], queryTime = 4
Output: 1
Explanation: The only student was doing their homework at the queryTime.

Example 3:

Input: startTime = [4], endTime = [4], queryTime = 5
Output: 0

Example 4:

Input: startTime = [1,1,1,1], endTime = [1,3,2,4], queryTime = 7
Output: 0

Example 5:

Input: startTime = [9,8,7,6,5,4,3,2,1], endTime = [10,10,10,10,10,10,10,10,10], queryTime = 5
Output: 5

Constraints:

startTime.length == endTime.length
1 <= startTime.length <= 100
1 <= startTime[i] <= endTime[i] <= 1000
1 <= queryTime <= 1000

分析

题目的意思是：给定两个数组，一个表示做作业开始的时间，另一个表示做作业结束的时间，然后给定一个queryTime，判断queryTime时刻正在做作业的人的数量，这里思路也非常直接了。直接遍历数组判断一下就行了，哈哈哈，leetcode居然有这么简单的题目。

代码

class Solution:
    def busyStudent(self, startTime: List[int], endTime: List[int], queryTime: int) -> int: 
        res=0
        for start,end in zip(startTime,endTime):
            if(queryTime>=start and queryTime<=end):
                res+=1
        return res