c ÓïÑÔ ¼ì²éÀ¨ºÅÆ¥Åä ²»ÄÜÔËÐÐ £¿£¿£¿£¿
¸÷λÇë°ïÎÒ¿´Ò»ÏÂÕâ¸ö¶«Î÷£¬ ÎÒÒªÔÚcÓïÑÔÖÐʵÏÖÀ¨ºÅÆ¥Å䣬Éè¼ÆË¼Â·£º°Ñ´ÓÁ´Õ»ÖÐɨÃèµÃµ½µÄ'}',¡®]',')'ÏÈ´æ´¢µ½¶¯Ì¬ÉêÇëµÄÄÚ´æ¿Õ¼äÖУ¬µ±É¨Ãèµ½¡®{','[','('ʱ ÔÚµ¯³öÏÈǰ´æ´¢µÄ¡¯£©¡®£¬¡¯]','}' ±È½Ï£¬À´¼ì²âÊÇ·ñÆ¥Åä
µ«ÊÇÔÚÔËÐÐÖгÌÐò²»¶¯ÁË£¬¾ÍÂé·³£¿£¿
linkstack.h:
typedef char ElemData;
typedef struct node
{
ElemData data;
struct node *next;
}LSnode,*Lstack;
typedef struct nodel
{
ElemData tdata;
struct nodel *tnext;
}TLSnode,*TLsnode;
linkedStack.cpp:
#include <stdio.h>
#include <malloc.h>
#include <string.h>
#include"linkstack.h"
Lstack GetData()
{
Lstack head;
LSnode *p;
head = NULL;
for(int i = 0; ;i++)
{
p =(LSnode*)malloc(sizeof(LSnode));
scanf("%c",&p->data);
p->next=head;
head = p;
if(p->data == '\n')
break;
}
return (head);
}
//ÔªËØ³öÕ»
int display(LSnode *p)
{ int L=0;
LSnode *l;
l=p->next;
while(p!=NULL)
{
printf("%c",p->data);
p=p->next;
L++;
}
printf("\n");
return L;
}
//ËãÊõ±í´ïʽÀ¨ºÅÆ
Ïà¹ØÎÊ´ð£º
¶¼ËµÍøÉÏÓкö࣬µ«ÎÒһֱûÕÒµ½¡£Èç¹ûÄúÖªµÀ£¬Çë¸æËßÎÒÏêϸµÄÏÂÔØµØÖ·¡£Òª´óÐÍÏîÄ¿»òÊǼܹ¹±È½ÏºÃµÄ¡£
ÄúÒ²²»Ìá51aspxÁË¡£ÉÏÃæµÄ¶«Î÷ÊDz»´í£¬µ«ÎÒÏëÒª¼Ü¹¹±È½ÏºÃµÄ¡£¡£
ÎÒÏë¿´¿´ËûÃÇÊÇÔõô×öÏîÄ¿ÕûºÏ ......
½üÈÕÐÖµÜÎÒÔÚÍøÉÏÏÂÁËÕã½´óѧԶ³Ì½ÌÓýCµÄÊÓÆµ,ÏàÐŲ»ÉÙÈËÒ²¶¼¿´¹ý,ÑÕêÍÖ÷½²µÄ,¸öÈ˾õµÃÑÕêͽ²µÄ·Ç³£×Ðϸ͸³¹,ÊʺÏ
ÐÂÊÖ¿´,Ö»ÊÇȱÉÙÅäÌ×µÄÊé,ËäÈ»ÔÚµ±µ±ÍøÒ²¿´µ½Õâ±¾Êé,Ò²²»ËãºÜ¹ó23RMB,µ« ......
13¸öÈËΧ³ÉһȦ£¬´ÓµÚÒ»¸öÈË¿ªÊ¼Ë³Ðò±¨ºÅ1£¬2£¬3¡£·²±¨µ½3ÕßÍ˳öȦ×Ó£¬ÕÒ³ö×îºóÁôÔÚȦ×ÓÖеÄÈËÔÀ´µÄÐòºÅ
½á¹ûÓ¦¸ÃÊÇ13 ¿ÉÎҵijÌÐòµÄ½á¹ûÊÇ11 Ï£ÍûºÃÐÄÈ˰ï¸ÄÒ»ÏÂ
#include <stdio.h>
#include < ......
GCCÊÇÃâ·ÑµÄÂð£¿ÄÇÓУ¿
LINUXϵͳÔõôװ£¿
ÖÐÎÄÔõôÉèÖã¿
Äã×°ÍêLinuxϵͳ¾Í»á×Ô´øGCC£¬windowsÏÂÒ²ÓÐGCC£¬±ÈÈçdev-c++,CODE::Blocks
linuxϵͳ°²×°¸ù¾Ý²»Í¬µÄlinux°æ±¾ÍøÉ϶¼Óн̳̣¬¿´ÏÂ¾Í ......
ÓÐÕâÑùÁ½¸öÎÊÌ⣬ϣÍû¸ßÊÖÖ¸µã£º
µÚÒ»£º
struct struct_A{
int a;
char b;
int c;
short d;
}
struct struct_B{
int a;
char b;
short c;
......