|
|||
随笔分类 - a piece of cake
摘要：/*递归法返回一个数组中的最大值*/#include<stdio.h>int maxValue(int array[],int n){if(n == 1)return array[0];if(array[0] >= maxValue(array+1,n-1))return array[0];elsereturn maxValue(array+1,n-1);}int main(){...
阅读全文
posted @ 2010-10-01 15:40
摘要：/**字符串就地逆序，递归法、非递归法**/#include<stdio.h>#include<string.h>//------------------------------------//以下是递归算法void reverse(char * str,int len,int i){char tmp;if(i < len){tmp = str[i];str[i] =...
阅读全文
posted @ 2010-09-30 12:36
摘要：/*求分数序列：2，3/2,5/3,8/5,13/8......的前50项的和分子：numerator，分母：denominator*/#include<stdio.h>float sum(int n){float numer =1.0;float denom =1.0;float sum = 0.0;float temp = 0.0;for(int i =1;i <= 50;i...
阅读全文
posted @ 2010-09-29 12:57
摘要：/*输入十个数，求最大值和次大值*/#define mini -1000;#include<stdio.h>int main(){int a,max=mini; int secd=mini;for(int i = 0; i <= 9; i++){scanf("%d",&a);if(a >= max){secd = max;max = a;}else if(a > secd){secd = a; }}printf("the max value is :%d\n",max);printf("the second max value is :%d\n",secd
阅读全文
posted @ 2010-09-29 00:38
摘要：/*输入一串字符串并打印，多余一个空格则只输出一个*/#include<stdio.h>void printString(){char lastc = 'a';char c;c = getchar();while(c != EOF){if(c !=' '){putchar(c);lastc = c;c = getchar(); }else{if(lastc != ' ') putchar(c); lastc = c; c = getchar();}}}int main(){ printString();return 1;}
阅读全文
posted @ 2010-09-27 17:17
|
|||
浙公网安备 33010602011771号