http://blog.sina.com.cn/s/blog_7ee076050102vamg.html http://www.cnblogs.com/lixiaohui-ambition/archive/2012/07/18/2598042.html int in=0; int j; char buffer[100]="Fred male 25,John male 62,Anna female 16"; //char buffer[100]="Fred male 2
NAME strchr, strrchr, strchrnul - locate character in string SYNOPSIS #include <string.h> char *strchr(const char *s, int c); char *strrchr(const char *s, int c); #define _GNU_SOURCE /* See feature_test_macro
理论知识自己能够百度这里直接上代码 代码的内容是 HDU(杭电)-1106-排序 排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41756 Accepted Submission(s): 11972 Problem Description 输入一行数字,假设我们把这行数字中的'5'都看成空格,那么就得到一行用空格切割的若干非负整数(可