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

add leetcode problem-cn part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
算法题（国内版）/problem (Chinese)/返回倒数第 k 个节点 [kth-node-from-end-of-list-lcci].html Normal file
View File

@@ -0,0 +1,12 @@
<p>实现一种算法，找出单向链表中倒数第 k 个节点。返回该节点的值。</p>
<p><strong>注意：</strong>本题相对原题稍作改动</p>
<p><strong>示例：</strong></p>
<pre><strong>输入：</strong> 1-&gt;2-&gt;3-&gt;4-&gt;5 和 <em>k</em> = 2
<strong>输出： </strong>4</pre>
<p><strong>说明：</strong></p>
<p>给定的 <em>k</em>&nbsp;保证是有效的。</p>