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

CµÄÖ¸ÕëÎÊÌâ

main()
{
int n, sleng();
char astr[50];

while(1){
scanf("%s",astr);
n = sleng(astr);
printf("length --> %d\n",n);
}
}

int sleng(char *s)
{
int n = 0;
while(*s++) n++;
return(n);
}
¼ÆËãÊäÈ볤¶ÈµÄ³ÌÐò£¬Õâ¸ö³ÌÐòÓÐÁ½¸öµØ·½²»Ì«Ã÷ÁË£º
1¡¢ scanf("%s",astr);Óëint sleng(char *s)¡¢ÕâÁ½¾äÓï¾äµÄÁªÏµÊDz»ÊÇchar *s = astr °ÑÊý×éµÄÊ×µØÖ·¸³Öµ¸øÖ¸ÕëµÄÉùÃ÷£¿
2¡¢ while(*s++) n++;Õâ¾ä»°²»ÊǺÜÇå³þ£¬ÎҸоõÊDz»ÊÇÓ¦¸Ã*£¨s++£©ÕâÑùд£¬ÒòΪ*µÄÓÅÏȶȴóÓÚ++£¬Èç¹ûÒªÊÇ*s++ÄÇô¾ÍÊÇÏÈÈ¡*sÄÚÈÝÈ»ºóÔÙ¼ÓÒ»£¬Èç¹ûÊäÈëÊÇ1£¬2£¬3ÄÇô*sÏÈÈ¡1£¬¶øºó»áÒ»Ö±¼ÓÕâ¸ö³ÌÐò¾Í»áÎÞÏÞÑ­»·µÄ¡£Ö»ÓÐ*£¨s++£©²ÅÊÇ1£¬2£¬3µÄ˳ÐòÔö¼Ó£¬×îºóΪ0ʱÍ˳ö¡£
Çë¸ßÊÖ°ïÖú¡£

1¡¢ scanf("%s",astr);Óëint sleng(char *s)¡¢ÕâÁ½¾äÓï¾äµÄÁªÏµÊDz»ÊÇchar *s = astr °ÑÊý×éµÄÊ×µØÖ·¸³Öµ¸øÖ¸ÕëµÄÉùÃ÷£¿
ÕâÁ½¾äÓÐʲôÁªÏµÄØ£¿µÚÒ»¾äÊÇÈÃÄãÊäÈëÕâ¸ö×Ö·ûÊý×é¡£µÚ2¾äÖеÄsÊǸöÐβΣ¬ÄãÔÚwhileÀïÃæ½«astrÕâ¸öÊý×éµÄµØÖ·Êµ²Î¸³¸øsÕâ¸öÐβΡ£

2  while(*s++) n++;¸Ä³ÉÕâÑùÄã¾ÍÓ¦¸ÃÃ÷°×ÁËwhile(*s){  n++;s++;}

1.
àÅn = sleng(astr);
2.*S++ºÍ*£¨s++£©ÎÒÊÔÁËÏÂÔËÐеĽá¹ûÒ»ÑùµÄ
»¹ÓÐÕâ±ßint n, sleng();//sleng()д´íÁË

»¹ÓÐ++µÄÓÅÏȼ¶ÔÚ*Ç°Ãæhttp://www.cppblog.com/aqazero/archive/2009/12/25/8284.html

2  Ö¸ÏòÏÂÒ»¸ö×Ö·û£¬µÝÔöÍêÁ˽øÐÐÏÂÒ»´ÎÅжϣ¬Èç¹ûÄãÄÇÑù£¬µÚÒ»¸ö×Ö·û¾ÍÅжϲ»ÉÏÁË¡£

char *s = "


Ïà¹ØÎÊ´ð£º

ÓÃC»òC++ÈçºÎ±àдÇó½â3Dħ·½³ÌÐò - C/C++ / C++ ÓïÑÔ

ÇëÎÊÓÃC»òC++ÈçºÎ±àдÇó½â3Dħ·½µÄ³ÌÐò£¬¸Ã´ÓºÎ¿ªÊ¼£¿
лл¸÷룬°ïæÌáµã½¨Òé°É¡£

http://www.mofang.net/code/176/182/6581.html

ÎÒÖ»ÄÜÍ»ÆÆ60Ã룡°¦¡£

ÎÒ¸Õ¹ý40Ãë

googleµÄandroidÖÐÓиöOpenGL ES + ......

Ïò¸ßÊÖÇë½Ìfortran µ÷ÓÃC µÄÎÊÌâ

ÎÒÏÖÔÚҪЩһ¸öfortranµ÷ÓÃC½Ó¿ÚµÄÎÊÌ⣬µ«ÊDz»ÖªµÀ CÓïÑÔÀïÃæ·ÖÅäµÄÖ¸ÕëÔõô¸¶¸øfortran,ÓÖ²»ÄÜÔÚfortranÁ¢ÂíÏÈ·ÖÅäºÃ£¬ÒµÎñÉϲ»ÔÊÐí¡£
ÎÒдÁ˸ö²âÊÔµÄÀý×Ó¡£µ«ÊDz»ÐС£
test.c
#include <stdio.h>
#incl ......

cÓïÑÔʵÏÖlinux timeÏà¹Øº¯Êý - C/C++ / CÓïÑÔ

ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......

ÓÃC±àдָ¶¨¾ùÖµ·½²îµÄ¸ß˹ÔëÉù - C/C++ / CÓïÑÔ

¸øÒÑ֪ͼÏñÌí¼Ó¸ß˹ÔëÉù£¬ÇëÎʸß˹ÔëÉùÊÇÔõôʵÏֵģ¿¾ùÖµ·½²î·Ö±ðΪu£¬v¡£
½²Ò»ÏÂ˼·ҲÐа¡¡£¡£¡£¡£¡£¡£
csdn ¸ßÊÖÔÆ¼¯µÄµØ·½¡£¡£¡£¡£¡£¡£

http://zhidao.baidu.com/question/71224083.html

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