qq_29762941的博客

1074 Reversing Linked List （25 分）Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given Lbeing 1→2→3→4→5→6, if K=3, then yo...

参考链接:链表翻转的图文讲解（递归与迭代两种实现）这里主要写了非递归的实现反转的函数实现：LNode *reverList(LNode *&head){ if(head == nullptr || head->next == nullptr) return head; LNode *pre = nullptr,*cur = head;//注意pre的初始值是...

1097 Deduplication on a Linked List （25 分）Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K,...