Skip to content

Commit 11ad598

Browse files
committed
deploy: f524a9a
1 parent 208354b commit 11ad598

File tree

10 files changed

+700
-36
lines changed

10 files changed

+700
-36
lines changed

contest/index.html

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -82392,9 +82392,9 @@
8239282392
<ul class="md-nav__list">
8239382393

8239482394
<li class="md-nav__item">
82395-
<a href="#409-2024-08-04-1030-90-3569" class="md-nav__link">
82395+
<a href="#409-2024-08-04-1030-90-3642" class="md-nav__link">
8239682396
<span class="md-ellipsis">
82397-
第 409 场周赛(2024-08-04 10:30, 90 分钟) 参赛人数 3569
82397+
第 409 场周赛(2024-08-04 10:30, 90 分钟) 参赛人数 3642
8239882398
</span>
8239982399
</a>
8240082400

@@ -86628,7 +86628,7 @@ <h2 id="_2">段位与荣誉勋章</h2>
8662886628
<h2 id="_3">赛后估分网站</h2>
8662986629
<p>如果你想在比赛结束后估算自己的积分变化,可以访问网站 <a href="https://lccn.lbao.site/">LeetCode Contest Rating Predictor</a>。</p>
8663086630
<h2 id="_4">往期竞赛</h2>
86631-
<h4 id="409-2024-08-04-1030-90-3569">第 409 场周赛(2024-08-04 10:30, 90 分钟) 参赛人数 3569</h4>
86631+
<h4 id="409-2024-08-04-1030-90-3642">第 409 场周赛(2024-08-04 10:30, 90 分钟) 参赛人数 3642</h4>
8663286632
<ul>
8663386633
<li><a href="../lc/3242/">3242. 设计相邻元素求和服务</a></li>
8663486634
<li><a href="../lc/3243/">3243. 新增道路查询后的最短距离 I</a></li>

en/lc/1508/index.html

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -77888,8 +77888,8 @@ <h2 id="description">Description</h2>
7788877888

7788977889
<pre>
7789077890
<strong>Input:</strong> nums = [1,2,3,4], n = 4, left = 1, right = 5
77891-
<strong>Output:</strong> 13
77892-
<strong>Explanation:</strong> All subarray sums are 1, 3, 6, 10, 2, 5, 9, 3, 7, 4. After sorting them in non-decreasing order we have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 1 to ri = 5 is 1 + 2 + 3 + 3 + 4 = 13.
77891+
<strong>Output:</strong> 13
77892+
<strong>Explanation:</strong> All subarray sums are 1, 3, 6, 10, 2, 5, 9, 3, 7, 4. After sorting them in non-decreasing order we have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 1 to ri = 5 is 1 + 2 + 3 + 3 + 4 = 13.
7789377893
</pre>
7789477894

7789577895
<p><strong class="example">Example 2:</strong></p>
@@ -78180,14 +78180,14 @@ <h3 id="solution-1-sorting">Solution 1: Sorting</h3>
7818078180

7818178181
<nav>
7818278182

78183-
<a href="https://github.com/rain84" class="md-author" title="@rain84">
78183+
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
7818478184

78185-
<img src="https://avatars.githubusercontent.com/u/1732547?v=4&size=72" alt="rain84">
78185+
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
7818678186
</a>
7818778187

78188-
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
78188+
<a href="https://github.com/rain84" class="md-author" title="@rain84">
7818978189

78190-
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
78190+
<img src="https://avatars.githubusercontent.com/u/1732547?v=4&size=72" alt="rain84">
7819178191
</a>
7819278192

7819378193

en/lc/3237/index.html

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -77872,8 +77872,8 @@ <h2 id="description">Description</h2>
7787277872

7787377873
<ul>
7787477874
<li>Initial order: <code>[1,2,3]</code></li>
77875-
<li>After the first query: <code>[<u><strong>3</strong></u>,2,1]</code></li>
77876-
<li>After the second query: <code>[<u><strong>3</strong></u>,2,1]</code></li>
77875+
<li>After the first query: <code>[<u><strong>3</strong></u>,1,2]</code></li>
77876+
<li>After the second query: <code>[<u><strong>3</strong></u>,1,2]</code></li>
7787777877
<li>After the last query: <code>[<u><strong>2</strong></u>,3,1]</code></li>
7787877878
</ul>
7787977879
</div>

en/lc/3243/index.html

Lines changed: 340 additions & 8 deletions
Large diffs are not rendered by default.

en/lc/600/index.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -77877,7 +77877,7 @@ <h2 id="description">Description</h2>
7787777877
3 : 11
7787877878
4 : 100
7787977879
5 : 101
77880-
Among them, only integer 3 disobeys the rule (two consecutive ones) and the other 5 satisfy the rule.
77880+
Among them, only integer 3 disobeys the rule (two consecutive ones) and the other 5 satisfy the rule.
7788177881
</pre>
7788277882

7788377883
<p><strong class="example">Example 2:</strong></p>

en/search/search_index.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

lc/1508/index.html

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -82489,7 +82489,7 @@ <h2 id="_1">题目描述</h2>
8248982489

8249082490
<pre>
8249182491
<strong>输入:</strong>nums = [1,2,3,4], n = 4, left = 1, right = 5
82492-
<strong>输出:</strong>13
82492+
<strong>输出:</strong>13
8249382493
<strong>解释:</strong>所有的子数组和为 1, 3, 6, 10, 2, 5, 9, 3, 7, 4 。将它们升序排序后,我们得到新的数组 [1, 2, 3, 3, 4, 5, 6, 7, 9, 10] 。下标从 le = 1 到 ri = 5 的和为 1 + 2 + 3 + 3 + 4 = 13 。
8249482494
</pre>
8249582495

@@ -82782,14 +82782,14 @@ <h3 id="_3">方法一:排序</h3>
8278282782

8278382783
<nav>
8278482784

82785-
<a href="https://github.com/rain84" class="md-author" title="@rain84">
82785+
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
8278682786

82787-
<img src="https://avatars.githubusercontent.com/u/1732547?v=4&size=72" alt="rain84">
82787+
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
8278882788
</a>
8278982789

82790-
<a href="https://github.com/yanglbme" class="md-author" title="@yanglbme">
82790+
<a href="https://github.com/rain84" class="md-author" title="@rain84">
8279182791

82792-
<img src="https://avatars.githubusercontent.com/u/21008209?v=4&size=72" alt="yanglbme">
82792+
<img src="https://avatars.githubusercontent.com/u/1732547?v=4&size=72" alt="rain84">
8279382793
</a>
8279482794

8279582795

0 commit comments

Comments
 (0)