[C]CÓïÑÔ»ù´¡¹®¹ÌרÌâ Á´±íÖ®£¨Á´±í·´×ª£©
Á´±íÊÇcÓïÑÔÖкÜÖØÒªµÄÊý¾Ý½á¹¹£¬ÊÇ¿¼²ìÒ»¸ö³ÌÐòÔ±µÄ»ù±¾¹¦µÄÊֶΣ¬Ö®Ç°ÔÚÒ»¼Ò¹«Ë¾ÃæÊÔʱ¾ÍÎʵ½ÁË
ʵÏÖÒ»¸öÁ´±íµÄ·´×ª£¬µ±Ê±¾ÍÊÇûÓкܺÃÀä¾²µÄ˼¿¼£¬½ñÌìÔÚÕâÀïд³öÀ´£¬¹²Ã㣡
»ù±¾Ëã·¨£º
1. ÅжÏÊÇ·ñΪ¿Õ£¬Èç¹ûΪ¿Õ£¬·µ»ØNULL
2. ·ñÔò˵Ã÷ÖÁÉÙÓÐÒ»¸ö½Úµã£¬ÄÇô
p2Ö¸Ïò×îºóÒ»¸ö½Úµã£¬p1Ö¸Ïòǰһ¸ö½Úµã£¬
°Ñp2Ö¸ÏòµÄ½ÚµãµÄnext ÖÃΪNULL(ÒòΪÕâ¸öµã½«ÊÇÁ´±íµÄĩβ½Úµã)
3. ½øÈëÑ»·
1£©ÈÃǰһ¸ö½ÚµãºÍºóÒ»¸ö½ÚµãÖØÐ½¨Á¢Á¬½Ó£»
2£©P2 ÍùÇ°ÒÆ£¬p2=p1;
3£©P1 ÍùÇ°ÒÆ£¬p1=p1->next¡£
ºóÁ½²½ÊÇΪÏÂÒ»¸öÑ»·×ö×¼±¸¡£
4. µ±p1Ϊ¿Õʱ£¬p2Ö¸ÏòµÄÊÇ×îºóÒ»¸ö½Úµã£¬ÄÇô·µ»Øp2.
»ù±¾´úÂëÈçÏ£º
struct Node
{
int num;
Node * next;
};
Node * reverse(Node * head)
{
if(head==NULL)
{
return NULL;
}
Node * p1,p2;
p2=head;
p1=head->next;
p2->next=NULL;
while(p1)
{
p1->next=p2;
p2=p1;
p1=p1->next;
}
return p2;
}
Ïà¹ØÎĵµ£º
http://docs.google.com/View?docid=ajbgz6fp3pjh_2dwwwwt#_38239340844832237
It is not about optimization.
The whole idea of using 'do/while' version
is to make a macro which will
expand into a regular statement, not into a
compound statement. This is
done in order to make the use of function-s ......
Ϊѻ·¿ØÖÆ£¬Ëü¿ÉÒÔ½«¼¯ºÏ(Collection)ÖеijÉÔ±ÑÐòä¯ÀÀÒ»±é¡£ÔË×÷·½Ê½Îªµ±Ìõ¼þ·ûºÏʱ£¬¾Í»á³ÖÐøÖØ¸´Ö´Ðеı¾ÌåÄÚÈÝ¡£
¡¡¡¡ Ϊѻ·¿ØÖÆ£¬Ëü¿ÉÒÔ½«¼¯ºÏ(Collection)ÖеijÉÔ±ÑÐòä¯ÀÀÒ»±é¡£ÔË×÷·½Ê½Îªµ±Ìõ¼þ·ûºÏʱ£¬¾Í»á³ÖÐøÖØ¸´Ö´Ðеı¾ÌåÄÚÈÝ¡£
¡¡¡¡Óï·¨
¡¡¡¡Óï·¨1£ºµü´úÒ»¼¯ºÏ¶ÔÏóÖ®ËùÓгÉÔ±
¡¡¡¡<c:forEac ......
1.int *p1 = *(int **)p2;
Õâ¸ö±í´ïʽ½«p2Ö¸ÏòµÄÖµµ±×öÖ¸ÕëÀàÐ͸³Öµ¸øp1
£¬½«ÆÕֵͨµ±×öÖ¸ÕëֵʹÓÃ
2.*£¨int **£©p1 = p2£»
Õâ¸ö±í´ïʽ½«p1Ö¸ÏòµÄÖµÐÞ¸ÄΪµÄp2±£´æµÄÖ¸Õë
µÄÖµ£¬½«Ö¸Õëµ±×öÆÕֵͨʹÓÃ
ÕâÊǽñÌì¿´us/OSµÄÄÚ´æ¹ÜÀíµÄʱºò¿´µ½µÄ£¬ÕæÊÇÌ«¾«±ÙÁË
°¦£¬¿´À´×Ô¼ºµÄ¼ûʶ»¹ÊÇÌ«ÉÙÁË£¬ÒÔºóµÃ¼Ó±¶Å ......
1. ÏÂÔØSQLitewindows°æ
ÎÒÃÇ¿ÉÒÔ´ÓÏÂÁÐÍøÕ¾ÏÂÔØsqliteµÄwindows°æ¡£
http://www.sqlite.com.cn/bbs/topicdisp.asp?tid=182&topage=1#gotolast
ÏÂÔØÕâ¸öÈý¸öÎļþ£º
SQLite 3.3.7 ÏÂÔØ
windows°æ
sqlite-3_3_7.zip Õâ¸öÊÇSQLiteµÄwindows¿ÉÖ´ÐÐÎļþ
sqlitedll-3_3_7.zip Õâ¸ö ......