From eb3cf99dde36deb0e5fa20399d432ac53e10d877 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Mon, 7 Jun 2021 13:19:42 +0800
Subject: [PATCH] =?UTF-8?q?=E9=9D=A2=E8=AF=95=E9=A2=98=2002.02:=E8=BF=94?=
 =?UTF-8?q?=E5=9B=9E=E5=80=92=E6=95=B0=E7=AC=AC=20k=20=E4=B8=AA=E8=8A=82?=
 =?UTF-8?q?=E7=82=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/KthNodeFromEndOfListLcci.java   | 54 +++++++++++++++++++
 .../editor/cn/KthNodeFromEndOfListLcci.md     | 13 +++++
 2 files changed, 67 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.java
 create mode 100644 src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.md

diff --git a/src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.java b/src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.java
new file mode 100644
index 0000000..14c26e2
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.java
@@ -0,0 +1,54 @@
+//实现一种算法，找出单向链表中倒数第 k 个节点。返回该节点的值。 
+//
+// 注意：本题相对原题稍作改动 
+//
+// 示例： 
+//
+// 输入： 1->2->3->4->5 和 k = 2
+//输出： 4 
+//
+// 说明： 
+//
+// 给定的 k 保证是有效的。 
+// Related Topics 链表 双指针 
+// 👍 72 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.ListNode;
+
+//面试题 02.02:返回倒数第 k 个节点
+public class KthNodeFromEndOfListLcci{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new KthNodeFromEndOfListLcci().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public int kthToLast(ListNode head, int k) {
+        ListNode p;
+        int count = 1;
+        p = head;
+        while (p.next != null) {
+            count++;
+            p = p.next;
+        }
+        p = head;
+        for (int i = 0; i < count - k; i++) {
+            p = p.next;
+        }
+        return p.val;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.md b/src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.md
new file mode 100644
index 0000000..3f5420e
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.md
@@ -0,0 +1,13 @@
+<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>
+<div><div>Related Topics</div><div><li>链表</li><li>双指针</li></div></div>\n<div><li>👍 72</li><li>👎 0</li></div>
\ No newline at end of file