From 4a7bc5544d805308357b3e51dce4d6dba2c94c6e Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Fri, 5 Feb 2021 15:02:27 +0800
Subject: [PATCH] =?UTF-8?q?=E5=8A=9B=E6=89=A3=EF=BC=9A=E5=89=91=E6=8C=87?=
 =?UTF-8?q?=20Offer=2022.=20=E9=93=BE=E8=A1=A8=E4=B8=AD=E5=80=92=E6=95=B0?=
 =?UTF-8?q?=E7=AC=ACk=E4=B8=AA=E8=8A=82=E7=82=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../leet/study/t20210205/GetKthFromEnd.java   | 29 +++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 LeetCode/src/main/java/com/code/leet/study/t20210205/GetKthFromEnd.java

diff --git a/LeetCode/src/main/java/com/code/leet/study/t20210205/GetKthFromEnd.java b/LeetCode/src/main/java/com/code/leet/study/t20210205/GetKthFromEnd.java
new file mode 100644
index 0000000..97536c7
--- /dev/null
+++ b/LeetCode/src/main/java/com/code/leet/study/t20210205/GetKthFromEnd.java
@@ -0,0 +1,29 @@
+package com.code.leet.study.t20210205;
+
+import com.code.leet.entiy.ListNode;
+
+/**
+ * 输入一个链表，输出该链表中倒数第k个节点。为了符合大多数人的习惯，本题从1开始计数，即链表的尾节点是倒数第1个节点。
+ *
+ * 例如，一个链表有 6 个节点，从头节点开始，它们的值依次是 1、2、3、4、5、6。这个链表的倒数第 2 个节点是值为 4 的节点。
+ *
+ * 来源：力扣（LeetCode）
+ * 链接：https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof
+ * 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
+ */
+public class GetKthFromEnd {
+    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;
+    }
+}