Ò׽ؽØͼÈí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

Cµ¥Á´±íµÄÄæÖÃÎÊÌâ¡£

ÄæÖú¯ÊýÀïÃæÁ½¾ä´úÂëµ÷»»Ë³ÐòΪʲô»á²úÉú¾Þ´ó²î±ð£¿ ÎÒ¾õµÃÕâÁ½¾ä»°Ë³Ðòµ÷»»²¢Ã»ÓÐʲô¸Ä±ä¡£
ÄæÖÃÁ´±í´úÂ룺
C/C++ code:
Node *reverse(Node *head)
{
Node *last,*mid=NULL;
while(head!=NULL)
{
last=mid;
mid=head;
head=head->link; //ÕâÒ»ÐÐ
mid->link=last;//»¹ÓÐÕâÒ»ÐУ¬µ÷»»Á˽á¹û¾Í´íÁË¡£Ôõô»á´í£¿
}
return mid;
}

³ÌÐò´úÂ룺
C/C++ code:
#include <stdio.h>
#include <stdlib.h>
typedef struct test
{
int num;
struct test *link;
}Node;
Node *insert(Node *head,int num)
{
Node *new_node,*ptr=head;
new_node=(Node *)malloc(sizeof(Node));
if(!new_node)
{
printf("error\n");
exit(1);
}
new_node->num=num;
new_node->link=NULL;
if(!head)
{
return new_node;
}
while(ptr->link!=NULL)
{
ptr=ptr->link;
}

ptr->link=new_node;
return head;
}
Node *reverse(Node *head)
{
Node *last,*mid=NULL;
while(head!=NULL)
{
last=mid;
mid=head;
head=head->link;
mid->link=last;
}
return mid;
}
void show(Node *head)
{
Node *temp=head;
while(temp!=NU


Ïà¹ØÎÊ´ð£º

ÄÜÓÃC/C++¼òµ¥ÊµÏÖÎå×ÓÆå³ÌÐòÂð?

×î½üͻȻÏë×Ô¼ºÀ´ÊµÏÖÒ»¸öÎå×ÓÆå³ÌÐò,µ«²»ÖªµÀÔõô¿ªÊ¼,×Ô¼ºÒ²Ã»Ñ§»­Í¼Ðκ¯Êý,ÄÜÔÚ¿ØÖÆ̨ÏÂÖ±½ÓдÂð>>>?????
¿ØÖÆ̨£¿±ÈͼÐνçÃæ¸üÂé·³¡£
http://search.download.csdn.net/search/%E4%BA%94%E5%AD%90% ......

´ó¼Ò¾õµÃ C Primer Plus Õâ±¾ÊéÔõôÑùÄØ£¿

ÓÃÕâ±¾ÊéÈëÃÅÔõôÑùÄØ  ¸úÌ·ºÆÇ¿µÄÏà±ÈÈçºÎ£¿ лл
ÎÒ°ÑÕâ±¾¿´Á˼¸Æª£¬È·ÊµºÜºÃµÄÊé¡£¾Í²»ÒªÄÃËü¸ú Ì· µÄÊé±ÈÁË£¬ Ì· µÄÊéÒªÕÕ¹ËÈ«¹ú¶ÁÕß¡£

²»¿ÉͬÈÕ¶øÓï

Ò»¸öÊǹúÍâµÄ£¬Ò»¸öÊǹúÄÚµÄ

ѧÍêc primer ......

C ѧÍê»ù´¡Äã¸Ã¸Éɶ

  ÏÖÔÚÌ·ºÆÇ¿µÄCÓïÑÔÒѾ­¿ìѧÍüÁË£¬µ«¶¼ÊǺܻù´¡µÄ¶«Î÷¸Ð¾õ£¬²»ÄܸÉʲô£¬ÒªÏëÔÙÌáÉý½ÓÏÂÀ´¸ÉµãɶºÃ


ÕÒ±¾¡¶Cר¼Ò±à³Ì¡·¿´¿´¡£ÄDZ¾ÊéÀïµÄ¶«Î÷²ÅÕæÕý½Ð»ù´¡¡£

¶¯ÊÖ
ѧÊý¾Ý½á¹¹
²¢±à³ÌʵÏÖ

Ì ......

½â»óVC ++ ÓëC ++


   
    VC ++ 6.0 visual studio  2003  ÓëC ++  ÓÐʲôÇø±ð <ѧVC֮ǰһ¶¨ÒªÑ§C++Âð£¿
    ²»¹ýÎÒÂòµÄÊ鶼ЩºÚ¿Í±à³ÌµÄ,ºÜÉÙÌáµ½MFCµÄ,ÊéÉϵÄÔ´ÂëÄ ......

ÇëC/C++¸ßÊÖ½ø£¬Çë½Ì£¡

¹¦ÄÜÊÇʵÏÖ×Ö·û´®µÄ·­×ª£¬²»ÖªµÀÄÄÀïÓдíÎó£¬ÇëÖ¸½Ì
#include <iostream>
#include <stdio.h>

using namespace std;
void reverse()
{
char ch;
scanf("%c",ch) ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØͼ | ¸ÓICP±¸09004571ºÅ