自学教程：C++ sortList函数代码示例

 ListNode *sortList(ListNode *head) {     if (head == NULL) return NULL;     int val = head->val;     ListNode h1(0), h2(0), h3(0), *t1 = &h1, *t2 = &h2, *t3 = &h3;     for (auto p = head; p; p = p->next){         if (p->val == val){             t2 = t2->next = p;         }else if (p->val < val){             t1 = t1->next = p;         }else{             t3 = t3->next = p;         }     }     t1->next = t2->next = t3->next = NULL;     h1.next = sortList(h1.next);     for (t1 = &h1; t1->next; t1 = t1->next);     t1->next = h2.next;     t2->next = sortList(h3.next);     return h1.next; }

ListNode* Solution148::sortList(ListNode *head){    if(head == NULL)        return NULL;    if(head->next == NULL)        return head;    ListNode* fast = head->next;    ListNode* slow = head;    while(fast != NULL && fast->next != NULL)    {        fast = fast->next->next;        slow = slow->next;    }    fast = slow->next;    slow->next = NULL;    slow = fast;    ListNode* l = sortList(head);    ListNode* r = sortList(slow);    return merge(l,r);}

    ListNode *sortList(ListNode *head) {        if(!head || head->next==NULL) return head;        ListNode* pA = head, *pB = head;        while( pA && pB && pB->next && pB->next->next )        {            pA = pA->next;            pB = pB->next->next;        }                pB= pA->next;        pA->next = NULL;        pA = head;        pA = sortList(pA);        pB = sortList(pB);               return MergeSortedList(pA, pB);    }

    void MultiListBox::sortByColumn(size_t _column, bool _backward)    {        mSortColumnIndex = _column;        if (_backward)        {            mSortUp = !mSortUp;            redrawButtons();            // если было недосортированно то сортируем            if (mFrameAdvise)                sortList();            flipList();        }        else        {            mSortUp = true;            redrawButtons();            sortList();        }    }

    ListNode* sortList(ListNode* head) {        if (head == NULL || head->next == NULL) {            return head;        }        ListNode *slow = head;        ListNode *fast = head;        //Get the middle index of list        while (fast->next && fast->next->next) {            slow  = slow->next;            fast = fast->next->next;        }        fast = slow->next;        slow->next = NULL;        ListNode *p1 = sortList(head);        ListNode *p2 = sortList(fast);        return merge(p1, p2);    }

 ListNode * sortList(ListNode * head) {     int iNodeCount = 0;          for (ListNode * pstCount = head; pstCount != NULL; pstCount = pstCount -> next)     {         iNodeCount ++;     }          return sortList(head, iNodeCount); }

void executeChoice(int choice, Node ** head){    char * fn = NULL;    char * fName = NULL;    char * lName = NULL;    char * position = NULL;    switch(choice)    {    case 1:        printList(*head);        break;    case 2:        fn = getFileName();        FILE* fout = openKnownFile(fn,"w");        printListToFile(*head,fout);        fclose(fout);        break;    case 3:        getPositionUser(&position);        printSpecificPlayers(*head, position);        free(position);        break;    case 4:        *head = sortList(*head, 1);        break;    case 5:        *head = sortList(*head, 2);        break;    case 6:        getPlayerName(&fName,&lName);        removeNode(head,fName,lName);        free(fName);        free(lName);        break;    default:        printf("Sorry incorrect input");    }}

    ListNode* sortList(ListNode* head) {        if(!head || !(head->next)) return head;                ListNode *fast = head;        ListNode *slow = head;        ListNode *pre = NULL;        while(fast && fast->next)        {            fast = fast->next->next;            pre = slow;            slow = slow->next;        }                pre->next = NULL;                head = sortList(head);        slow = sortList(slow);                return mergeTwoLists(head,slow);    }

    ListNode* sortList(ListNode* head) {        if (!head || !head->next)            return head;        // Find the middle        ListNode *slow = head, *fast = head;        while (fast->next && fast->next->next)        {            fast = fast->next->next;            slow = slow->next;        }        // Cut at middle        ListNode *p = slow;        slow = slow->next;        p->next = NULL;        ListNode *l1 = sortList(head);        ListNode *l2 = sortList(slow);        return mergeTwoLists(l1, l2);    }

/************************************************************************    Set sort mode************************************************************************/void ItemListBase::setSortMode(SortMode mode){    if (d_sortMode != mode)    {        d_sortMode = mode;        if (d_sortEnabled && !d_initialising)            sortList();        WindowEventArgs e(this);        onSortModeChanged(e);    }}

/*    Start the request (and complete it) */static void startDir(HttpQueue *q){    HttpConn        *conn;    HttpTx          *tx;    HttpRx          *rx;    MprList         *list;    MprDirEntry     *dp;    Dir             *dir;    cchar           *path;    uint            nameSize;    int             next;    conn = q->conn;    rx = conn->rx;    tx = conn->tx;    dir = conn->data;    assert(tx->filename);    if (!(rx->flags & (HTTP_GET | HTTP_HEAD))) {        httpError(conn, HTTP_CODE_BAD_METHOD, "Bad method");        return;    }    httpSetHeaderString(conn, "Cache-Control", "no-cache");    httpSetHeaderString(conn, "Last-Modified", conn->http->currentDate);    httpSetHeaderString(conn, "Content-Type", "text/html");    parseQuery(conn);    if ((list = mprGetPathFiles(tx->filename, MPR_PATH_RELATIVE)) == 0) {        httpWrite(q, "<h2>Cannot get file list</h2>/r/n");        outputFooter(q);        return;    }    if (dir->pattern) {        filterDirList(conn, list);    }    sortList(conn, list);    /*        Get max filename size     */    nameSize = 0;    for (next = 0; (dp = mprGetNextItem(list, &next)) != 0; ) {        nameSize = max((int) strlen(dp->name), nameSize);    }    nameSize = max(nameSize, 22);    path = rx->route->prefix ? sjoin(rx->route->prefix, rx->pathInfo, NULL) : rx->pathInfo;    outputHeader(q, path, nameSize);    for (next = 0; (dp = mprGetNextItem(list, &next)) != 0; ) {        outputLine(q, dp, tx->filename, nameSize);    }    outputFooter(q);    httpFinalize(conn);}

	ListNode *sortList(ListNode *head){		if (head==NULL||head->next==NULL){			return head;		}		ListNode *slow=head,*fast=head;		//假定head存放数据		while (fast->next!=NULL&&fast->next->next!=NULL){			fast=fast->next->next;			slow=slow->next;		}		ListNode *head1=slow->next;		ListNode *head2=head;		slow->next=NULL;//slow指向null		head1=sortList(head1);		head2=sortList(head2);		return merge(head1,head2);	}

void RobotDecoder::DelayTime::endTiming() {	const int timeDelta = _decoder->getTickCount() - _startTime;	for (uint i = 0; i < kDelayListSize; ++i) {		if (_timestamps[i] == _oldestTimestamp) {			_timestamps[i] = ++_newestTimestamp;			_delays[i] = timeDelta;			break;		}	}	++_newestTimestamp;	_startTime = 0;	sortList();}

int findSingleOccurenceNumber(int *A, int len) {	int index;	if (A == NULL)		return -1;	sortList(A, 0, len - 1);	for (index = 0; index < len; index += 3)	{		if (A[index] != A[index + 2])			return A[index];	}}

 ListNode* sortList(ListNode* head) {     int n = getLength(head);     if (n == 0 || n == 1)     {         return head;     }     n /= 2;     ListNode* pl = head;     ListNode* pr = head;     while (n)     {         --n;         pl = pr;         pr = pr->next;     }     pl->next = NULL;     pl = sortList(head);     pr = sortList(pr);     head = mergeList(pl, pr);     return head; }

/*Not implemented - Return possible Moves for Color sorted according to heuristic value*/ListNode *getCandidateMovesOrd(Game *game, Color col){	ListNode *tmp = getCandidateMoves(game, col);	return tmp;	ListNode *head = tmp;	while (head != NULL){		if (head->move == NULL)break;		if (isEmpty(game->board[head->move->dest->column][head->move->dest->row])) head->value = -1000;		else head->value = scoreChar(game->board[head->move->dest->column][head->move->dest->row], oppositeCol(col)) - scoreChar(game->board[head->move->source->column][head->move->source->row], col);		head = head->next;	}	tmp = sortList(tmp);	return tmp;}

int TestsortList1(){  START_TEST_CASE;  DocumentNode *d;  d = NULL;  d = sortList(d);    SHOULD_BE( d == NULL );    freeDocNodeList(d);    END_TEST_CASE;}

	void Armature::updateSlotsZOrder(){		std::vector<Slot*> sortList(_slotList.size());		for(Slot* slot : _slotList)		{			sortList[(int)slot->getZOrder()] = slot;			if(slot->_isDisplayOnStage)			{				slot->_displayBridge->addDisplay(_display);			}		}					_slotsZOrderChanged = false;	}

 ListNode *sortList(ListNode *head){     if (head == NULL)         return head;     else if (head->next == NULL)          return head;          ListNode *slow = head, *fast = head;     while (fast->next != NULL && fast->next->next != NULL)     {         slow = slow->next;         fast = fast->next->next;     }     fast = slow;     slow = slow->next;     fast->next = NULL;          fast = sortList(head);     slow = sortList(slow);          return mergeList(fast,slow);      }

    ListNode *sortList(ListNode *head) {        // IMPORTANT: Please reset any member data you declared, as        // the same Solution instance will be reused for each test case.				if(!head || !head->next)			return head;		ListNode* slow, *fast;		slow = head;		fast = slow->next;		while(fast){			if(!fast->next || !fast->next->next)				break;			slow = slow->next;			fast = fast->next->next;		}		fast = slow->next;		slow->next = NULL;		head = sortList(head);		fast = sortList(fast);		return merge(head, fast);    }

void sll_012_sort(struct node *head){	int n1=0, n2=0, n3=0;	struct node *cur;	cur = head;	while (cur!= NULL)	{		if (cur->data == 0) n1++;		if (cur->data == 1) n2++;		if (cur->data == 2) n3++;		cur = cur->next;	}	sortList(head, n1, n2, n3);}

 ListNode *sortList(ListNode *head)  {     if(head == NULL || head->next == NULL)         return head;          ListNode *slow = head, *fast = head, *prev;     while(fast && fast->next)     {         prev = slow;         slow = slow->next;         fast = fast->next->next;     }          prev->next = NULL;          ListNode *part1 = sortList(head);     ListNode *part2 = sortList(slow);          ListNode dummy(-1);     ListNode *cur = &dummy;     while(part1 || part2)     {         int val1 = part1? part1->val: INT_MAX;         int val2 = part2? part2->val: INT_MAX;         if(val1 <= val2)         {             cur->next = part1;             part1 = part1->next;         }         else         {             cur->next = part2;             part2 = part2->next;         }         cur = cur->next;     }     return dummy.next; }

		ListNode* sortList(ListNode* head) {			if (!head || !head->next)				return head;						ListNode* fast = head;			ListNode* slow = head;			/*			 * a good way: find the half list.			 * */			while(fast->next && fast->next->next) {				fast = fast->next->next;				slow = slow->next;			}			fast = slow->next;			slow->next = NULL;			ListNode* p1 = sortList(head);			ListNode* p2 = sortList(fast);			return merge(p1, p2);		}

node*  pushToReadyQueue(struct taskControlBlock tskCtrlBloc[numberOfThreads]){//pushes all tasks into linkedlist with task status as READYnode *first, *newnode, *head, *temp;int len=0,i=0;	first = (node *)malloc(sizeof(node));	 		head = (node *)malloc(sizeof(node));	temp = (node *)malloc(sizeof(node));	head -> TCB = tskCtrlBloc[i];	head-> next = NULL;	first = head;	printf("first node : %d/n", first->TCB.taskId);	i++;while(1)//tskCtrlBloc[i].taskId < numberOfTasks{	if(tskCtrlBloc[i].taskId == numberOfTasks)		break;		newnode = (node *)malloc(sizeof(node));	newnode->TCB  = tskCtrlBloc[i];	newnode->next = NULL;	first->next = newnode;	first = newnode;	printf("new node :  %d %d %d/n", first->TCB.taskId, newnode->TCB.taskId,i);	i++;			} newnode = (node *)malloc(sizeof(node));newnode->TCB  = tskCtrlBloc[i];newnode->next = NULL;first->next = newnode;/*while(head != NULL){len++;head = head->next;} printf("Length : %d/n", len); */printList(head);temp = sortList(head);printList(temp);/* printf("HEad : %d/n", temp->TCB.taskId);temp = temp->next;printf("HEad : %d/n", temp->TCB.taskId);*/return temp;}

/** * Sorts the saves by date. * @param action Pointer to an action. */void SavedGameState::sortDateClick(Action *){	if (Options::saveOrder == SORT_DATE_ASC)	{		Options::saveOrder = SORT_DATE_DESC;	}	else	{		Options::saveOrder = SORT_DATE_ASC;	}	updateArrows();	_lstSaves->clearList();	sortList(Options::saveOrder);}

 ListNode* sortList(ListNode* head) {     if(head == NULL || head->next == NULL) return head;     ListNode* ptr = head;     int i = 0;     while(ptr != NULL) {         i ++;         ptr = ptr->next;     }     int length = i;     i = 0;     ListNode* ptr1 = head;     ListNode* ptr2 = head;     ListNode* prePtr = NULL;     while(i < length/2) {         i ++;         prePtr = ptr2;         ptr2 = ptr2->next;     }     prePtr->next = NULL;     prt1 = sortList(ptr1);     ptr2 = sortList(ptr2);     return merge(ptr1, ptr2); }

static void processDir(HttpQueue *q){    HttpConn        *conn;    HttpTx          *tx;    HttpRx          *rx;    MprList         *list;    MprDirEntry     *dp;    Dir             *dir;    uint            nameSize;    int             next;    conn = q->conn;    rx = conn->rx;    tx = conn->tx;    dir = conn->data;    mprLog(5, "processDir");    mprAssert(tx->filename);    httpSetHeaderString(conn, "Cache-Control", "no-cache");    httpSetHeaderString(conn, "Last-Modified", conn->http->currentDate);    parseQuery(conn);    list = mprGetPathFiles(tx->filename, 1);    if (list == 0) {        httpWrite(q, "<h2>Can't get file list</h2>/r/n");        outputFooter(q);        return;    }    if (dir->pattern) {        filterDirList(conn, list);    }    sortList(conn, list);    /*        Get max filename     */    nameSize = 0;    for (next = 0; (dp = mprGetNextItem(list, &next)) != 0; ) {        nameSize = max((int) strlen(dp->name), nameSize);    }    nameSize = max(nameSize, 22);    outputHeader(q, rx->pathInfo, nameSize);    for (next = 0; (dp = mprGetNextItem(list, &next)) != 0; ) {        outputLine(q, dp, tx->filename, nameSize);    }    outputFooter(q);    httpFinalize(conn);}