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

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


Ïà¹ØÎÊ´ð£º

Des¼ÓÃÜÎÊÌ⣬C Ëã·¨ÓëJavaËã·¨ÓÐÇø±ðÂð£¿

C++ÖÐʹÓÃDesºóµÃ²»µ½ÓëJavaÖÐÓÃDES/ECB/PKCS5Padding·½Ê½¼ÓÃÜÏàͬµÄ½á¹û¡£

ÄÇλ´óϺÅöµ½¹ýÕâÑùµÄÎÊÌâ°¡£¿

ÖªµÀÔõô½â¾öµÄ´óϺ¿ìÀ´¾ÈÃü°¡!~~~~~~~~~~~~~
ÓÑÇéup


ÔõôÄüÓÃÜËã·¨ºÍ¼ÓÃÜģʽÏòÌáÃû ......

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 LINUX ÎÊÌâ

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

LINUXϵͳÔõôװ£¿


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

C³ÌÐòÎÊÌâ

ÓÐÕâÑùÁ½¸öÎÊÌ⣬ϣÍû¸ßÊÖÖ¸µã£º
µÚÒ»£º
struct struct_A{
int a;
char b;
int c;
short d;
}
  struct struct_B{
  int a;
  char b;
  short c;
  ......

É¢·Ö£¬ÎªC£¯C++ÂÛ̳Ôö¼ÓµãÈËÆø£¡£¡

É¢·Ö£¬ÎªC£¯C++ÂÛ̳Ôö¼ÓµãÈËÆø£¡£¡
jf

jf£¬Â¥Ï±£³Ö¶ÓÐÎ

Ö»¼û¹ý²»¸ÒÉ¢·ÖµÄ£¬Ã»¼û¹ý²»¸Ò½Ó·ÖµÄ

½Ó



ǰÅÅÁôÃû

jf

ÕâÀïÈËÆø»¹²»´í°¡£¡

½Ó·Ö ¡­¡­ C/C++ºÃÈÈÄÖ¶î¡­¡­ÆäËû°æ¿é¾ÍÏà¶ÔûÕâôÈÈÁË ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ