//数据压缩算法https://bbs.csdn.net/topics/392743332
static int a[] = { 1, 2, 2, 2, 3, 3, 5, 5, 5, 5, 2, 2, 7, 7, 7, 9, 9, 9, 9, 9 }, b[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int 序 = 0, 比=a[0], 记=0, 数=0, 量 = sizeof(a) / sizeof(a[0]);
while (序<量)
{
if (比 == a[序])
{
if (++数>1)a[序]=-1;//重复的数据标记-1输出时判断非-1
++序;
}
else
{
b[记++] = 数;
比 = a[序];
数 = 0;
}
}
b[记++] = 数;
//输出a b数组就不写了