mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -10,7 +10,7 @@
|
||||
|
||||
</ul>
|
||||
|
||||
|
||||
|
||||
|
||||
<p>For example, if inserting element <code>3</code> into <code>nums = [1,2,3,5]</code>, the <strong>cost</strong> of insertion is <code>min(2, 1)</code> (elements <code>1</code> and <code>2</code> are less than <code>3</code>, element <code>5</code> is greater than <code>3</code>) and <code>nums</code> will become <code>[1,2,3,3,5]</code>.</p>
|
||||
|
||||
@@ -22,7 +22,7 @@ Insert 6 with cost min(2, 0) = 0, now nums = [1,5,6].
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
|
||||
|
||||
@@ -37,7 +37,7 @@ Insert 4 with cost min(3, 2) = 2, now nums = [1,2,3,4,5,6].
|
||||
Insert 1 with cost min(0, 0) = 0, now nums = [1].
|
||||
|
||||
Insert 5 with cost min(1, 0) = 0, now nums = [1,5].
|
||||
|
||||
|
||||
Insert 6 with cost min(2, 0) = 0, now nums = [1,5,6].
|
||||
|
||||
Insert 2 with cost min(1, 2) = 1, now nums = [1,2,5,6].
|
||||
|
Reference in New Issue
Block a user