leetcode-problemset/leetcode-cn/problem (English)/返回倒数第 k 个节点(English) [kth-node-from-end-of-list-lcci].html

<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>
update 2022-03-29 12:43:11 +08:00			`<p>Implement an algorithm to find the kth to last element of a singly linked list. 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->2->3->4->5 和 <em>k</em> = 2`
			`<strong>Output: </strong>4</pre>`

			`<p><strong>Note: </strong></p>`

			`<p>k is always valid.</p>`