feat: add solutions to lc problem: No.1450. Number of Students Doing

Homework at a Given Time

Author: yanglbme

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

@@ -72,15 +72,61 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def busyStudent(self, startTime: List[int], endTime: List[int], queryTime: int) -> int:
+        count, n = 0, len(startTime)
+        for i in range(n):
+            count += startTime[i] <= queryTime <= endTime[i]
+        return count
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int busyStudent(int[] startTime, int[] endTime, int queryTime) {
+        int count = 0, n = startTime.length;
+        for (int i = 0; i < n; ++i) {
+            if (startTime[i] <= queryTime && queryTime <= endTime[i]) {
+                ++count;
+            }
+        }
+        return count;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int busyStudent(vector<int>& startTime, vector<int>& endTime, int queryTime) {
+        int count = 0, n = startTime.size();
+        for (int i = 0; i < n; ++i) {
+            if (startTime[i] <= queryTime && queryTime <= endTime[i]) {
+                ++count;
+            }
+        }
+        return count;
+    }
+};
+```
 
+### **Go**
+
+```go
+func busyStudent(startTime []int, endTime []int, queryTime int) int {
+	count, n := 0, len(startTime)
+	for i := 0; i < n; i++ {
+		if startTime[i] <= queryTime && queryTime <= endTime[i] {
+			count++
+		}
+	}
+	return count
+}
 ```
 
 ### **...**

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

@@ -69,13 +69,59 @@ The third student started doing homework at time 3 and finished at time 7 and wa
 ### **Python3**
 
 ```python
-
+class Solution:
+    def busyStudent(self, startTime: List[int], endTime: List[int], queryTime: int) -> int:
+        count, n = 0, len(startTime)
+        for i in range(n):
+            count += startTime[i] <= queryTime <= endTime[i]
+        return count
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int busyStudent(int[] startTime, int[] endTime, int queryTime) {
+        int count = 0, n = startTime.length;
+        for (int i = 0; i < n; ++i) {
+            if (startTime[i] <= queryTime && queryTime <= endTime[i]) {
+                ++count;
+            }
+        }
+        return count;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int busyStudent(vector<int>& startTime, vector<int>& endTime, int queryTime) {
+        int count = 0, n = startTime.size();
+        for (int i = 0; i < n; ++i) {
+            if (startTime[i] <= queryTime && queryTime <= endTime[i]) {
+                ++count;
+            }
+        }
+        return count;
+    }
+};
+```
 
+### **Go**
+
+```go
+func busyStudent(startTime []int, endTime []int, queryTime int) int {
+	count, n := 0, len(startTime)
+	for i := 0; i < n; i++ {
+		if startTime[i] <= queryTime && queryTime <= endTime[i] {
+			count++
+		}
+	}
+	return count
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int busyStudent(vector<int>& startTime, vector<int>& endTime, int queryTime) {
+        int count = 0, n = startTime.size();
+        for (int i = 0; i < n; ++i) {
+            if (startTime[i] <= queryTime && queryTime <= endTime[i]) {
+                ++count;
+            }
+        }
+        return count;
+    }
+};

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

@@ -0,0 +1,9 @@
+func busyStudent(startTime []int, endTime []int, queryTime int) int {
+	count, n := 0, len(startTime)
+	for i := 0; i < n; i++ {
+		if startTime[i] <= queryTime && queryTime <= endTime[i] {
+			count++
+		}
+	}
+	return count
+}

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

@@ -0,0 +1,11 @@
+class Solution {
+    public int busyStudent(int[] startTime, int[] endTime, int queryTime) {
+        int count = 0, n = startTime.length;
+        for (int i = 0; i < n; ++i) {
+            if (startTime[i] <= queryTime && queryTime <= endTime[i]) {
+                ++count;
+            }
+        }
+        return count;
+    }
+}

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

@@ -0,0 +1,6 @@
+class Solution:
+    def busyStudent(self, startTime: List[int], endTime: List[int], queryTime: int) -> int:
+        count, n = 0, len(startTime)
+        for i in range(n):
+            count += startTime[i] <= queryTime <= endTime[i]
+        return count