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

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


Ïà¹ØÎÊ´ð£º

jspÖÐ <c:if test> Ïà¹ØÎÊÌâ

ÔÚ²éѯºó½«²éѯ³öÀ´µÄÖµ¸³¸ø¸÷ÊäÈë¿ò
<c:if test="${not empty dataValue}">
      fm.SAMPLING_DATE.value=" <c:out value='${dataValue.SAMPLING_DATE}'/ ......

dllµ¼³ö·½·¨Ç°¼Óextern "C"±¨´í

Í·ÎļþÀïÕâô¶¨Òå
public:
    extern "C" __declspec(dllexport) HRESULT  ABC();
public:
    extern "C" __declspec(dllexport) void BBB();
......

<c:foreach>¶àÖØÑ­»·ÎÊÌâ ǶÌ×Ñ­»·

<%
Map map = new HashMap();
map.put("1", "2");
map.put("3", "23");
map.put("4", "32");
map.put("23", "42&q ......

Ϊʲôc¿âtimeº¯Êý²»ÄÜʹÓð¢

ÎÒÏë»ñµÃµ±Ç°µÄʱ¼ä£¬windows mobileÉÏÄÜÓÃtime_t time(time_t *timer)º¯Êý£¬Ìáʾlnk´íÎó¡£ÎªÊ²Ã´²»ÄÜÓÃÄØ£¿ ÐèÒªÔö¼ÓʲôÁ¬½Ó¿âÂð£¿Ãû×ÖÊÇʲô£¿
Çå³þµÄ¼ÇµÃ c¿âµÄtime_tÊÇ¿ÉÒÔʹÓõģ¬Ó¦¸ÃÊÇÆäËûµÄÎÊÌâµ¼Öµġ£
......

ÇóÖúcµÄÎÊÌâ

1001.exe ÖÐµÄ 0x0041394f ´¦Î´´¦ÀíµÄÒì³£: 0xC0000005: дÈëλÖà 0x66792e62 ʱ·¢Éú·ÃÎʳåÍ»

ÕâÊÇÔõô»ØÊ£¿Ð»Ð»ÁË£¬ÎÒÊDzËÄñ
Ë­ÖªµÀÔõô»ØÊ¡­¡­ÕâÊǸöͨÓõĴíÎóÌáʾ¡­¡­ÉÏ´úÂë

ÐèÒªÖØÐ½øÐбàÒë

Ò ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ