【数据结构与算法面试题】统计上排数在下排出现的次数

#define len 10

void get_every_num(int *a, int *b) {
  // 1、初始化
  for (int i = 0; i < len; i++) {
    b[i] = 0;
  }
  // 2、修改值
  int changed = 1;
  while (changed) {
    changed = 0;
    for (int i = 0; i < len; i++) {
      int count = 0;
      for (int j = 0; j < len; j ++) {
        if (a[i] == b[j]) count ++;
      }
      if (b[i] != count) {
        b[i] = count;
        changed ++;
      }
    }
  }
}