格式字符串的输入输出

name=Jorden,job=palyer,age=45

[[name,Jorden],[job,player],[age,45]]

name=Jorden,job=,age=45

‘=‘ 和 ‘,‘ 

  1 #include<stdio.h>
  2 #include<malloc.h>
  3 
  4 #define true 1
  5 #define false 0
  6 
  7 //获得字符串长度
  8 int getlen(char *s)
  9 {
 10     int i;
 11     for (i=0; s[i]!=‘\0‘; i++) {
 12         ;
 13     }
 14     return i;
 15 }
 16 //获得特定字符在字符串内的个数
 17 int num_char(char *s, char flg)
 18 {
 19     int i, count = 0;
 20     for (i=0; s[i]!=‘\0‘; i++) {
 21         if (s[i] == flg) {
 22             count++;
 23         }
 24     }
 25     return count;
 26 }
 27 //获得特定字符在字符串内的位置，返回p
 28 void find_char(char *s, char flg, int *p)
 29 {
 30     int i, index = 0;
 31     for (i=0; s[i]!=‘\0‘; i++) {
 32         if (s[i] == flg) {
 33             p[index++] = i;
 34         }
 35     }
 36 }
 37 
 38 int main(void)
 39 {
 40     char s[256], out[256] = "[[";
 41     int count_c, count_e, count_t;
 42     int *p_c, *p_e, *p_t;
 43     int i, j, e=0, c=0, flg, n=2;
 44     scanf("%s", s);
 45 
 46     count_c = num_char(s, ‘,‘);
 47     count_e = num_char(s, ‘=‘);
 48 
 49     //判断逗号个数跟等号个数的关系
 50     if ((count_e < 1) || (count_c != count_e - 1)) {
 51         printf("input error");
 52         return 1;
 53     }
 54     //p_c逗号的位置，p_e等号的位置
 55     p_c = (int *)(malloc(sizeof(int) * count_c));
 56     p_e = (int *)(malloc(sizeof(int) * count_e));
 57 
 58     find_char(s, ‘,‘, p_c);
 59     find_char(s, ‘=‘, p_e);
 60     //等号在逗号之前，同时最后一个等号在最后一个逗号之后
 61     //其实这里默认允许空内容的存在了。
 62     for (i=0; i<count_c; i++) {
 63         if (p_c[i] < p_e[i]) {
 64             printf("input error");
 65             return 1;
 66         }
 67     }
 68     if (p_e[count_e-1] < p_c[count_c-1]) {
 69         printf("input error");
 70             return 1;
 71     }
 72 
 73     //把所有的位置都记录下来，第一个位置是-1,最后一个为字符串长度
 74     count_t = count_c + count_e + 2;
 75     p_t = (int *)(malloc(sizeof(int) * (count_t)));
 76     p_t[0] = -1;
 77     flg = true;
 78     for(i=1; i<count_t-1; i++) {
 79         if (flg == true) {
 80             p_t[i] = p_e[e++];
 81         } else {
 82             p_t[i] = p_c[c++];
 83         }
 84         flg = !flg;
 85     }
 86     p_t[count_t - 1] = getlen(s);
 87 
 88     free(p_c);
 89     free(p_e);
 90 
 91     //把位置里的字符串移到out字符串内
 92     flg = true;
 93     for (i=0; i<count_t-1; i++) {
 94         for (j=p_t[i]+1; j<p_t[i+1]; j++) {
 95             out[n++] = s[j];
 96         }
 97         if (flg == true) {
 98             out[n++] = ‘,‘;
 99         } else {
100             out[n++] = ‘]‘;
101             out[n++] = ‘,‘;
102             out[n++] = ‘[‘;
103         }
104         flg = !flg;
105     }
106     //收尾处理
107     n=n-2;
108     out[n++] = ‘]‘;
109     out[n++] = ‘\0‘;
110 
111     free(p_t);
112     printf("%s", out);
113 
114     system("pause");
115     return 0;
116 }