coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-21 03:13:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode-cn/problem (Chinese)/移除指定数字得到的最大结果 [remove-digit-from-number-to-maximize-result].html
View File

@@ -7,7 +7,7 @@
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入：</strong>number = "123", digit = "3"
<strong>输入：</strong>number = "123", digit = '3'
<strong>输出：</strong>"12"
<strong>解释：</strong>"123" 中只有一个 '3' ，在移除 '3' 之后，结果为 "12" 。
</pre>
@@ -15,7 +15,7 @@
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入：</strong>number = "1231", digit = "1"
<strong>输入：</strong>number = "1231", digit = '1'
<strong>输出：</strong>"231"
<strong>解释：</strong>可以移除第一个 '1' 得到 "231" 或者移除第二个 '1' 得到 "123" 。
由于 231 &gt; 123 ，返回 "231" 。
@@ -24,7 +24,7 @@
<p><strong>示例 3：</strong></p>
<pre>
<strong>输入：</strong>number = "551", digit = "5"
<strong>输入：</strong>number = "551", digit = '5'
<strong>输出：</strong>"51"
<strong>解释：</strong>可以从 "551" 中移除第一个或者第二个 '5' 。
两种方案的结果都是 "51" 。