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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode-cn/problem (Chinese)/裁剪数字后查询第 K 小的数字 [query-kth-smallest-trimmed-number].html
View File

@@ -13,7 +13,7 @@
<p><strong>提示：</strong></p>
<ul>
<li>裁剪到剩下 <code>x</code>&nbsp;个数位的意思是不断删除最左边的数位，直到剩下 <code>x</code>&nbsp;个数位。</li>
<li>裁剪到剩下最右边 <code>x</code>&nbsp;个数位的意思是不断删除最左边的数位，直到剩下 <code>x</code>&nbsp;个数位。</li>
<li><code>nums</code>&nbsp;中的字符串可能会有前导 0 。</li>
</ul>
@@ -57,3 +57,7 @@
<li><code>1 &lt;= k<sub>i</sub> &lt;= nums.length</code></li>
<li><code>1 &lt;= trim<sub>i</sub> &lt;= nums[0].length</code></li>
</ul>
<p>&nbsp;</p>
<p><strong>进阶：</strong>你能使用 <strong>基数排序算法</strong> 解决此问题吗？这种解法的复杂度又是多少？</p>