题目链接:点击打开链接
题目大意:略
解题思路:略
相关企业
- 字节跳动
AC 代码
- Java
// 解决方案(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++
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; } };