feat: update lc problems

solution/2900-2999/2970.Count the Number of Incremovable Subarrays I/README.md

@@ -29,7 +29,7 @@ tags:
 
 <p><b>注意</b>&nbsp;，剩余元素为空的数组也视为是递增的。</p>
 
-<p><strong>子数组</strong> 指的是一个数组中一段连续的元素序列。</p>
+<p><strong>子数组</strong> 指的是一个数组中一段非空且连续的元素序列。</p>
 
 <p>&nbsp;</p>
 

solution/3200-3299/3215.Count Triplets with Even XOR Set Bits II/README.md

@@ -14,7 +14,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3215.Co
 
 <!-- description:start -->
 
-<p>给定三个整数数组&nbsp;<code>a</code>，<code>b</code>&nbsp;和&nbsp;<code>c</code>，返回组内元素按位&nbsp;<code>XOR</code>&nbsp;有&nbsp;<strong>偶数</strong>&nbsp;个 设置位 的三元组&nbsp;<code>(a[i], b[j], c[k])</code>&nbsp;的数量。</p>
+<p>给定三个整数数组&nbsp;<code>a</code>，<code>b</code>&nbsp;和&nbsp;<code>c</code>，返回组内元素按位&nbsp;<code>XOR</code>&nbsp;有&nbsp;<strong>偶数</strong>&nbsp;个 <span data-keyword="set-bit">设置位</span> 的三元组&nbsp;<code>(a[i], b[j], c[k])</code>&nbsp;的数量。</p>
 
 <p>&nbsp;</p>
 

solution/CONTEST_README.md

@@ -152,7 +152,7 @@ comments: true
 - [3122. 使矩阵满足条件的最少操作次数](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md)
 - [3123. 最短路径中的边](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md)
 
-#### 第 393 场周赛(2024-04-14 10:30, 90 分钟) 参赛人数 4218
+#### 第 393 场周赛(2024-04-14 10:30, 90 分钟) 参赛人数 4219
 
 - [3114. 替换字符可以得到的最晚时间](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README.md)
 - [3115. 质数的最大距离](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README.md)

solution/main.py

@@ -359,7 +359,7 @@ def get_contests(fetch_new=True) -> List:
             c = Contest(i, contest_type=t)
             if c.contest_title_slug in d:
                 continue
-            contest_data = c.get_data(retry=3)
+            contest_data = c.get_data(retry=10)
             if not contest_data:
                 cnt += 1
                 if cnt > 2: