LeetCode（剑指 Offer）- 22. 链表中倒数第k个节点

LeetCode（剑指 Offer）- 22. 链表中倒数第k个节点

题目大意：略

解题思路：略

相关企业

字节跳动

AC 代码

Java

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */// 解决方案(1)class Solution { public ListNode getKthFromEnd(ListNode head, int k) { int len = 0; ListNode cur = head; while (cur != null) { len++; cur = cur.next; } k = len - k; for (int i = 0; i < k; i++) { head = head.next; } return head; }}// 解决方案(2)class Solution { public ListNode getKthFromEnd(ListNode head, int k) { ListNode former = head, latter = head; for(int i = 0; i < k; i++) former = former.next; while(former != null) { former = former.next; latter = latter.next; } return latter; }}

C++

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* getKthFromEnd(ListNode* head, int k) { ListNode *former = head, *latter = head; for(int i = 0; i < k; i++) former = former->next; while(former != nullptr) { former = former->next; latter = latter->next; } return latter; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。