54 lines
1.5 KiB
Java
54 lines
1.5 KiB
Java
|
//输入一个链表，输出该链表中倒数第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)
|
|||
|
|
|
|||
|
|
}
|