Question

怎么介绍c语言的录取和显示功能

Answer 1

class Solution {
public:
ListNode* insertionSortList(ListNode* head) {
ListNode dummy(INT_MIN);
ListNode* cur = head;
while (cur !=nullptr)
{
ListNode* pos = findInsertPos(&dummy, cur->val);
ListNode* tmp = cur->next; //记录当前遍历节点的下一个节点，以便继续遍历下个节点
cur->next = pos->next;
pos->next = cur;
cur = tmp;
}