feat: add solutions to lc problem: No.2580

No.2580.Count Ways to Group Overlapping Ranges

Author: yanglbme

solution/2500-2599/2580.Count Ways to Group Overlapping Ranges/README.md

@@ -251,6 +251,24 @@ func countWays(ranges [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countWays(ranges: number[][]): number {
+    ranges.sort((a, b) => a[0] - b[0]);
+    let mx = -1;
+    let ans = 1;
+    const mod = 10 ** 9 + 7;
+    for (const [start, end] of ranges) {
+        if (start > mx) {
+            ans = (ans * 2) % mod;
+        }
+        mx = Math.max(mx, end);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2580.Count Ways to Group Overlapping Ranges/README_EN.md

@@ -233,6 +233,24 @@ func countWays(ranges [][]int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countWays(ranges: number[][]): number {
+    ranges.sort((a, b) => a[0] - b[0]);
+    let mx = -1;
+    let ans = 1;
+    const mod = 10 ** 9 + 7;
+    for (const [start, end] of ranges) {
+        if (start > mx) {
+            ans = (ans * 2) % mod;
+        }
+        mx = Math.max(mx, end);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2580.Count Ways to Group Overlapping Ranges/Solution.ts

@@ -0,0 +1,13 @@
+function countWays(ranges: number[][]): number {
+    ranges.sort((a, b) => a[0] - b[0]);
+    let mx = -1;
+    let ans = 1;
+    const mod = 10 ** 9 + 7;
+    for (const [start, end] of ranges) {
+        if (start > mx) {
+            ans = (ans * 2) % mod;
+        }
+        mx = Math.max(mx, end);
+    }
+    return ans;
+}

solution/CONTEST_README.md

@@ -11,8 +11,8 @@
 
 | 段位  | 比例   | 段位名   | 国服分数线    | 勋章                                                                    |
 | ----- | ------ | -------- | --------- | --------------------------------------------------------------------------- |
-| LV3 | 5%  | Guardian | &ge;2265.64 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Guardian.gif" style="width: 80px;" /></p> |
-| LV2 | 20% | Knight   | &ge;1894.28 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Knight.gif" style="width: 80px;" /></p>   |
+| LV3 | 5%  | Guardian | &ge;2251.88 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Guardian.gif" style="width: 80px;" /></p> |
+| LV2 | 20% | Knight   | &ge;1879.80 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Knight.gif" style="width: 80px;" /></p>   |
 | LV1 | 75% | -        | -         | -                                                                           |
 
 力扣竞赛 **全国排名前 10** 的用户，全站用户名展示为品牌橙色。

solution/contest.py

@@ -127,8 +127,8 @@ def generate_contest_list():
 
 | 段位  | 比例   | 段位名   | 国服分数线    | 勋章                                                                    |
 | ----- | ------ | -------- | --------- | --------------------------------------------------------------------------- |
-| LV3 | 5%  | Guardian | &ge;2265.64 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Guardian.gif" style="width: 80px;" /></p> |
-| LV2 | 20% | Knight   | &ge;1894.28 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Knight.gif" style="width: 80px;" /></p>   |
+| LV3 | 5%  | Guardian | &ge;2251.88 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Guardian.gif" style="width: 80px;" /></p> |
+| LV2 | 20% | Knight   | &ge;1879.80 | <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/Knight.gif" style="width: 80px;" /></p>   |
 | LV1 | 75% | -        | -         | -                                                                           |
 
 力扣竞赛 **全国排名前 10** 的用户，全站用户名展示为品牌橙色。

solution/rating.py

@@ -104,7 +104,7 @@ def get_user_ranking(self, uid):
         return None
 
     def get_1600_count(self):
-        left, right = 1, 1000 if self.region == 'CN' else 3000
+        left, right = 1, 4000
         while left < right:
             mid = (left + right + 1) >> 1
             page = self.load_page(mid)
@@ -116,17 +116,17 @@ def get_1600_count(self):
                 left = mid
             else:
                 right = mid - 1
-        page = self.load_page(left)
+        page = [uid for _, uid in self.load_page(left) if uid]
         print('校准中...')
         left, right = 0, len(page) - 1
         while left < right:
             mid = (left + right + 1) >> 1
-            ranking, score = self.get_user_ranking(page[mid][1])
+            ranking, score = self.get_user_ranking(page[mid])
             if score >= 1600:
                 left = mid
             else:
                 right = mid - 1
-        return self.get_user_ranking(page[left][1])[0]
+        return self.get_user_ranking(page[left])[0]
 
     def get_user(self, rank):
         p = (rank - 1) // 25 + 1