From 26d4cd38713bd4be2f142f3c26093f9812b785c4 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Mon, 7 Jun 2021 13:17:14 +0800
Subject: [PATCH] =?UTF-8?q?=E5=89=91=E6=8C=87=20Offer=2022:=E9=93=BE?=
 =?UTF-8?q?=E8=A1=A8=E4=B8=AD=E5=80=92=E6=95=B0=E7=AC=ACk=E4=B8=AA?=
 =?UTF-8?q?=E8=8A=82=E7=82=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/src/main/java/leetcode/editor/cn/LianBiaoZhongDaoShuDiKgeJieDianLcof.java b/src/main/java/leetcode/editor/cn/LianBiaoZhongDaoShuDiKgeJieDianLcof.java
new file mode 100644
index 0000000..3f4835e
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/LianBiaoZhongDaoShuDiKgeJieDianLcof.java
@@ -0,0 +1,54 @@
+//输入一个链表，输出该链表中倒数第k个节点。为了符合大多数人的习惯，本题从1开始计数，即链表的尾节点是倒数第1个节点。 
+//
+// 例如，一个链表有 6 个节点，从头节点开始，它们的值依次是 1、2、3、4、5、6。这个链表的倒数第 3 个节点是值为 4 的节点。 
+//
+// 
+//
+// 示例： 
+//
+// 
+//给定一个链表: 1->2->3->4->5, 和 k = 2.
+//
+//返回链表 4->5. 
+// Related Topics 链表 双指针 
+// 👍 199 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.ListNode;
+
+//剑指 Offer 22:链表中倒数第k个节点
+public class LianBiaoZhongDaoShuDiKgeJieDianLcof{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new LianBiaoZhongDaoShuDiKgeJieDianLcof().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 ListNode getKthFromEnd(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;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/LianBiaoZhongDaoShuDiKgeJieDianLcof.md b/src/main/java/leetcode/editor/cn/LianBiaoZhongDaoShuDiKgeJieDianLcof.md
new file mode 100644
index 0000000..24c0773
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/LianBiaoZhongDaoShuDiKgeJieDianLcof.md
@@ -0,0 +1,13 @@
+<p>输入一个链表，输出该链表中倒数第k个节点。为了符合大多数人的习惯，本题从1开始计数，即链表的尾节点是倒数第1个节点。</p>
+
+<p>例如，一个链表有 <code>6</code> 个节点，从头节点开始，它们的值依次是 <code>1、2、3、4、5、6</code>。这个链表的倒数第 <code>3</code> 个节点是值为 <code>4</code> 的节点。</p>
+
+<p> </p>
+
+<p><strong>示例：</strong></p>
+
+<pre>
+给定一个链表: <strong>1->2->3->4->5</strong>, 和 <em>k </em><strong>= 2</strong>.
+
+返回链表 4<strong>->5</strong>.</pre>
+<div><div>Related Topics</div><div><li>链表</li><li>双指针</li></div></div>\n<div><li>👍 199</li><li>👎 0</li></div>
\ No newline at end of file