作业社区
探索学习新天地,共享知识资源!
橋本 的学生作业:
#include int find_max(int x, int y) { if(x>y) { return x; } else { return y; } } int find_min(int x, int y) { if (x < y) { return x; } else { return y; } } int get_result(int x, int y, int (*funp)(int, int)) { int result = 0; result = funp(x, y); return result; } int main() { printf("The max number is %d\n", get_result(10, 20, find_max)); printf("The min number is %d\n", get_result(10, 20, find_min)); return 0; }
+8
橋本 的学生作业:
#include char* design_array(int* plen) { static char a[100] = { 0 }; int len = sizeof(a) / sizeof(a[0]); *plen = len; return a; } char* input_array() { int num = 0; char* p = design_array(&num); printf("Please input characters:"); fgets(p, num, stdin); return p; } void output_array(char *p) { for (int i = 0;p[i] != '\0';i++) { printf("%c ", p[i]); } } int count_space(char* p) { int count = 0; for (int i = 0;p[i] != '\0';i++) { if (p[i] == ' ') count++; } return count; } int main() { char* str = input_array(); output_array(str); printf("has %d space\n", count_space(str)); return 0; }
+8