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

µÚÒ»Ì⣺
  struct struct_A{
  int a;
  char b;
  int c;
  short d;
  };
  struct_A *p = NULL;
  sizeof(p)µÈÓÚ¶àÉÙ£¿

µÚ¶þÌ⣺ ......

С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++)
{
......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ