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

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

@@ -0,0 +1,13 @@
<p>Implement an algorithm to find the kth to last element of a singly linked list.&nbsp;Return the value of the element.</p>
<p><strong>Note: </strong>This problem is slightly different from the original one in the book.</p>
<p><strong>Example: </strong></p>
<pre>
<strong>Input: </strong> 1-&gt;2-&gt;3-&gt;4-&gt;5 和 <em>k</em> = 2
<strong>Output: </strong>4</pre>
<p><strong>Note: </strong></p>
<p>k is always valid.</p>