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

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


Ïà¹ØÎÊ´ð£º

×ÉѯһÏÂb/sÓëc/sÖ®¼äͨѶÎÊÌâ

ÂíÉÏÒª×öÒ»¸öÏîÄ¿Õâ¸öÏîÄ¿¾ßÌ幤×÷ģʽÈçÏÂ

¡¾1¡¿ÀûÓÃc/sʵʱ»ñÈ¡Ó²¼þÉ豸²ÎÊý
¡¾2¡¿ÒìµØ¿Í»§ÏµÍ³Í¨¹ýÍøÂçIE·½Ê½ÊµÊ±ä¯ÀÀÓ²¼þÉ豸²ÎÊý£¬Ò²¾ÍÊÇb/s¹¤×÷·½Ê½

ÄÇôÎÊÌâÊÇc/sÓëb/sÖ®¼äÈçºÎͨѶ£¬²ÅÄÜÈà ......

СCµÄÎÊÌâ¹þ

C/C++ code:
#include <stdio.h>
typedef struct node{
int *key;
int length;
}node;
void insert(node &temp,int n)
{
int i,j;
for(i=0;i<=temp.length;i++)
{
......

CÎļþ¶ÁдÎÊÌâ¡£

FILE *pFile;
errno_t m_err;
m_err = fopen_s(&pFile,"1.txt","r");
char ch[100];
memset(ch,0,100);
fread(ch,1,100,pFile);
MessageBox(ch);
fclose(pFil ......

°Ù˼²»µÃÆä½âµÄC³ÌÐòÎÊÌ⣬¸ßÊÖÇë½ø£¡

ÎÊÌâÃèÊö£º
ÓÐÒ»¼òµ¥µÄC³ÌÐò£¬ÈçÏ£º
void foo ( ) {
int i ;
p r i n t f ( "%d " , i ++);
}
int main ( ){ int j ;
for ( j = 0 ; j < 1 0 ; ++j ) foo ( ) ;
}

º¯ ......

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