Number of Students Doing Homework at a Given Time
给两个数组和一个数, 问这个数在不在两个数组对应的ith数之间.
1 2 3 4 5 6 7 8 9 10 11 12 |
class Solution { public int busyStudent(int[] startTime, int[] endTime, int queryTime) { int res = 0; int n = startTime.length; for(int i = 0; i < n; i++) { if(startTime[i] <= queryTime && queryTime <= endTime[i]){ res++; } } return res; } } |