本文主要是介绍[leetcode]删除链表中倒数第k个结点,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
. - 力扣(LeetCode)
class Solution {
public:ListNode* trainningPlan(ListNode* head, int cnt) {int n = 0;ListNode* node = nullptr;for (node = head; node; node = node->next) {n++;}for (node = head; n > cnt; n--) {node = node->next;}return node;}
};
class Solution {
public:ListNode* trainningPlan(ListNode* head, int cnt) {ListNode* fast = head;ListNode* slow = head;while (fast && cnt > 0) {fast = fast->next;cnt--;}while (fast) {fast = fast->next;slow = slow->next;}return slow;}
};
这篇关于[leetcode]删除链表中倒数第k个结点的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!