学步园

格式化输入输出文件

#include "stdafx.h"<br /> #include <stdlib.h><br /> #include "string.h"<br /> #include "stdio.h"<br /> int main()<br /> {<br /> FILE *fp;<br /> int number[3];<br /> int score[3];<br /> int i = 0;<br /> int rece_Number = 0;<br /> if((fp = fopen("test.txt","r")) == NULL)<br /> {<br /> fprintf(stderr,"Error opening file!/n");<br /> }<br /> for(i =0;i<3;i++)<br /> {<br /> fscanf(fp,"%d %d",&number[i],&score[i]);//学号与成绩用空格<br /> }<br /> printf("Please input number:/n");<br /> scanf("%d",&rece_Number);<br /> for(i = 0;i<3;i++)<br /> {<br /> if(rece_Number == number[i])<br /> break;<br /> }<br /> printf("The Number's score is %d/n",score[i]);<br /> fclose(fp);<br /> return 0;<br /> }<br />  

统计字符串中最长的重复字符串

#include "stdafx.h"<br /> #include "string.h"<br /> #include "malloc.h"</p> <p>int main()<br /> {<br /> int i,j,k,t;<br /> int max = 0;<br /> char *p = NULL;<br /> char str[42] = "2xtuaojy5678zuaojy908puaojy417uaojy356";<br /> char temp[8];<br /> char result[8];<br /> memset(result,0,8);<br /> p = str;<br /> for(i=0;i <42;i++)<br /> {<br /> for(j=i+1;j <42;j++)<br /> {<br /> if(*(p+i)== *(p+j))<br /> {<br /> t = i;<br /> k = 0;<br /> memset(temp,0,8);<br /> //只要找到了相同的首字符，就开始比较直到没有相同的字符，记录当前字符串，看是否是最长的<br /> while(*(p+t)== *(p+j))<br /> {<br /> temp[k] = *(p+t);//不断比较后续的字符<br /> t++;<br /> j++;<br /> k++;<br /> }<br /> if(k > max)//将最长的字符串赋值给result<br /> {<br /> max = strlen(temp);<br /> strcpy(result,temp);<br /> }</p> <p> } </p> <p> }</p> <p> }<br /> //打印出结果在上述字符串中最长的是 "zuaojy"<br /> printf("重复字符串最长的是 %s,长度为 %d /n",result,max);<br /> return 0;<br /> } 

通过递归求字符串中出现的相同字符次数

int count_times(char ch,const char* str)<br /> {<br /> int count = 0;<br /> if(*str == '/0')<br /> {<br /> count = 0;<br /> }<br /> else<br /> {<br /> if((*str)==ch)<br /> {<br /> count = 1+count_times(ch,str+1);<br /> }<br /> else<br /> {<br /> count = count_times(ch,str+1);<br /> }<br /> }<br /> return count;<br /> }