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

ÇóÒ»¸öÁ´±í³ÌÐò c¸ßÊÖÇë½ø

µ¥Á´±íÖи÷½áµã´æ·ÅÒ»¸öÊý£¬Çë°´ÉýÐòÅÅÁÐ
лл ¸÷λ´óϺ

±¾È˳õѧÊý¾Ý½á¹¹ Ï£Íû´óϺ°ïһϠÈëÃÅ

Õâ¸öºÜ¼òµ¥µÄ°¡,Äã¿ÉÒÔ½¨Á¢Ò»¸ö¸¨ÖúÁ´±í,ÿ´ÎÕÒÁ´±íÖÐ×îСµÄÊýµÄ½Úµã²åÈëµ½ÐÂÁ´±íÖÐ,×Ô¼º³¢ÊÔдÏÂ,²»ÄѵÄ

±éÀú¹ýÈ¥£¬Ã°ÅݾͿÉÒÔ¡£

ðÅݰ¢
³õѧ¶¼µÃ»áµÄ

C/C++ code:

#include<stdio.h>

typedef struct node{
char data;
struct node *next;
}Link;

void
display(Link *h)
{
Link *t;
t=h->next;
while(t!=NULL)
{
printf("%d->",t->data);
t=t->next;
}
}
Link *
creat_link()
{
int run=1,v,i=1;
Link *h,*t,*s;
h=(Link *)malloc(sizeof(Link));
if(NULL==h)
exit(1);
t=h;
while(run)
{
printf("please input the %drd node vlaue:",i++);
scanf("%d",&v);
if(v!=-1) //ÊäÈë-1±íʾÁ´±í½áÊø
{
s=(Link*)malloc(sizeof(Link));
if(NULL==s)
exit(1);
s->data=v;
t->next=s;
t=s;
}
else
run=0;
}
t->next=NULL;

printf("before sort,the link is :");
display(h);
return h;
}

void
sort(Link *h)
{
Link *r,*p,*q;
if(h!=NULL)
{
p=h->next;
r=p->next;
p-


Ïà¹ØÎÊ´ð£º

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

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

¹ØÓÚ×Ö·û´®µÄCÃæÊÔÌâ

¸øÒ»¸ö×Ö·û´®¡¢ÀýÈç ¡°ababc¡±ÒªÇ󷵻ء°ab¡±. ÒòΪ¡°ab¡±Á¬ÐøÖظ´³öÏÖÇÒ×¡£  ÓÃC/C£«£«ÓïÑÔдһº¯ÊýÍê³É¸ÃËã·¨£¬¸ø³ö¸´ÔÓ¶È
Õâ¸öÌâÎÒ²»»á

C/C++ code:

#include <iostream>
#include <s ......

ÎļþÎÊÌ⣿C´óÏÀÇë½ø

ÔÚCÓïÑÔÖÐÈçºÎ´ò¿ªÒ»¸öÒÑÖªµÄÎļþ¡£Èç´ò¿ªÃûΪadd.txtµÄÎļþ¼ÙÉèËüÔÚC:\\Promgram Files\add.txt.ÒªÇó´ò¿ªÊ±²»¸Ä±äÆäÀïÃæµÄÄÚÈÝ¡£¸ßÊÖÇë½â´ðϰ¡
fopen( "C:\\Promgram Files\add.txt" , "rb" ......

CÇóÖú£º·Ö¸îÊý×é

±ÈÈçÊý×éarray[100]="12@good@thanks@men@";
Ôõô×ö²ÅÄܽ«array1[100]="12";array2[100]="good";array3[100]="thanks";array4="men";

ÐèÒªÔõô×öÄØ?CÀ ......

Îļþ¶ÁдÎÊÌâ c¸ßÊÖÇë½ø

ÏÂÃæÊÇÎҵĴúÂë ´ÓÄÚ´æÐ´ÈëÎļþÕýÈ· µ«´ÓÎļþ¶ÁÈëÄÚ´æ¶¼ÊÇÂÒÂë ¶øÇÒ³ÌÐò±ÀÀ£ Çëc¸ßÊÖÖ¸µã
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct inf
{
  & ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ