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

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;
}

 
//ËãÊõ±í´ïʽÀ¨ºÅÆ


Ïà¹ØÎÊ´ð£º

Çóc/sÏîĿԴÂë ¸Ðл

¶¼ËµÍøÉÏÓкö࣬µ«ÎÒһֱûÕÒµ½¡£Èç¹ûÄúÖªµÀ£¬Çë¸æËßÎÒÏêϸµÄÏÂÔØµØÖ·¡£Òª´óÐÍÏîÄ¿»òÊǼܹ¹±È½ÏºÃµÄ¡£

ÄúÒ²²»Ìá51aspxÁË¡£ÉÏÃæµÄ¶«Î÷ÊDz»´í£¬µ«ÎÒÏëÒª¼Ü¹¹±È½ÏºÃµÄ¡£¡£

ÎÒÏë¿´¿´ËûÃÇÊÇÔõô×öÏîÄ¿ÕûºÏ ......

pro*c ÀïÔõô½«select µÄ·µ»ØÄÚÈݸ³Öµ¸ø±äÁ¿

pro*c ÀïÔõô½«select µÄ·µ»ØÄÚÈݸ³Öµ¸ø±äÁ¿

EXEC SQL BEGIN DECLARE SECTION;
      char CALLNO[30];
  EXEC SQL END DECLARE SECTION;

 
  EXEC SQL S ......

cµÄ×Ö·û´®ÎÊÌâ

fastshow()
{
FILE *fp;
char name[10];
char ch[512];
printf("ÇëÊäÈë´ýÏÔʾµÄÎļþÃû\n");
scanf("%s",name);
if((fp=fopen(name,"r"))==NULL)
{
printf ......

c LINUX ÎÊÌâ

GCCÊÇÃâ·ÑµÄÂð£¿ÄÇÓУ¿

LINUXϵͳÔõôװ£¿


ÖÐÎÄÔõôÉèÖã¿
Äã×°ÍêLinuxϵͳ¾Í»á×Ô´øGCC£¬windowsÏÂÒ²ÓÐGCC£¬±ÈÈçdev-c++,CODE::Blocks
linuxϵͳ°²×°¸ù¾Ý²»Í¬µÄlinux°æ±¾ÍøÉ϶¼Óн̳̣¬¿´ÏÂ¾Í ......

Çë½Ìc¸ßÊÖ£¬defineµÄÎÊÌâ

¸÷λ´óÏÀ£¬Ð¡µÜÓÐÒ»¸öÎÊÌâÇë½Ì£¬ÈçÏÂ
Õâ¸ö #define stack_push ÊÇÒ»¸öº¯Êý£¬µ÷ÓÃÊÇÕâÑùµÄ

int len;
stack_t *stack;
const char *curpos;
int seglen;
const char *next_slash;
int i;
......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ