Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö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»ù´¡

#include <string.h>
#include <stdio.h>

void main()
{
int i;
char buf[]="abcde";
strncpy(buf,"abc",3);
for(i=0;i <5;i++)
printf(&q ......

CÈí¼þ תÕý¹¤×ʶàÉÙºÏÊÊ£¿

µØµãÔÚÉîÛÚÄÏɽ
¡¡¡¡×öCÈí¼þ¡£ÊÔÓÃ2K£¬²»ÖªµÀתÕý¸ø¹«Ë¾Ì¸¶àÉÙºÏÊʰ¡£¿
¡¡¡¡ÁíÍ⣬±¾ÈËС±¾£¬Ó¢ÓïÁù¼¶£¬ÊÔÓÃÈý¸öÔ±íÏÖµÃÒ²ËãÖÐÉÏˮƽ¡£µ«ÊÇÏÖÔÚ»¹²»ÄÜ×öÏîÄ¿¡£ÁíÍâ±ÏҵѧУûÓÐÃûÆø¡£
¡¡¡¡×ªÕý¸ø¹«Ë¾Ì¸¶àÉ ......

ÄãÃÇÏÖÔÚ»¹ÔÚÓÃCÂð£¿CÓÐǰ;Âð£¿

ÄãÃÇÏÖÔÚ»¹ÔÚÓÃCÂð£¿CÓÐǰ;Âð£¿
Ò»¶¨£¬²¢ÓÀÔ¶¼á³Ö

ÒýÓÃ
Ò»¶¨£¬²¢ÓÀÔ¶¼á³Ö

¶¥

ÓÐÓá£

Â¥Ö÷ºÎ³ö´ËÑÔ

Â¥Ö÷À´c°æÎÊÕâ¸öÎÊÌâÊÇÌß¹ÝÓÃÒâÂð¹þ¹þ

Ô½À´Ô½ÀäÊǿ϶¨µÄ£¬ÍêÈ«ÌÔÌ­µ¹Ò²Ã»ÄÇôÈÝÒ×

c ......

Çë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ºÅ