feat: update solutions to lc problems

Author: yanglbme

solution/0700-0799/0729.My Calendar I/README.md

@@ -66,9 +66,8 @@ class MyCalendar:
 
     def book(self, start: int, end: int) -> bool:
         idx = self.sd.bisect_right(start)
-        if 0 <= idx < len(self.sd):
-            if end > self.sd.values()[idx]:
-                return False
+        if idx < len(self.sd) and end > self.sd.values()[idx]:
+            return False
         self.sd[end] = start
         return True
 

solution/0700-0799/0729.My Calendar I/README_EN.md

@@ -58,9 +58,8 @@ class MyCalendar:
 
     def book(self, start: int, end: int) -> bool:
         idx = self.sd.bisect_right(start)
-        if 0 <= idx < len(self.sd):
-            if end > self.sd.values()[idx]:
-                return False
+        if idx < len(self.sd) and end > self.sd.values()[idx]:
+            return False
         self.sd[end] = start
         return True
 

solution/0700-0799/0729.My Calendar I/Solution.py

@@ -7,9 +7,8 @@ def __init__(self):
 
     def book(self, start: int, end: int) -> bool:
         idx = self.sd.bisect_right(start)
-        if 0 <= idx < len(self.sd):
-            if end > self.sd.values()[idx]:
-                return False
+        if idx < len(self.sd) and end > self.sd.values()[idx]:
+            return False
         self.sd[end] = start
         return True
 

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores/README.md

@@ -49,7 +49,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-排序。
+**方法一：排序**
 
 <!-- tabs:start -->
 

solution/2300-2399/2327.Number of People Aware of a Secret/README.md

@@ -53,6 +53,10 @@
 
 **方法一：差分数组**
 
+差分数组 $d[i]$ 记录每天知道秘密的人数变化情况，$cnt[i]$ 记录第 $i$ 天新得知秘密的人数。那么从 $[i+delay,i+forget)$ 的这段时间内，$cnt[i]$ 个人每天都能分享给另外 $cnt[i]$ 个人。
+
+最终 $sum(d[:n+1])$ 就是答案。
+
 时间复杂度 $O(n^2)$。
 
 <!-- tabs:start -->
@@ -77,7 +81,7 @@ class Solution:
                     cnt[nxt] += cnt[i]
                     nxt += 1
         mod = 10**9 + 7
-        return list(accumulate(d))[n] % mod
+        return sum(d[: n + 1]) % mod
 ```
 
 ### **Java**

solution/2300-2399/2327.Number of People Aware of a Secret/README_EN.md

@@ -67,7 +67,7 @@ class Solution:
                     cnt[nxt] += cnt[i]
                     nxt += 1
         mod = 10**9 + 7
-        return list(accumulate(d))[n] % mod
+        return sum(d[: n + 1]) % mod
 ```
 
 ### **Java**

solution/2300-2399/2327.Number of People Aware of a Secret/Solution.py

@@ -13,4 +13,4 @@ def peopleAwareOfSecret(self, n: int, delay: int, forget: int) -> int:
                     cnt[nxt] += cnt[i]
                     nxt += 1
         mod = 10**9 + 7
-        return list(accumulate(d))[n] % mod
+        return sum(d[: n + 1]) % mod