统计串里连续出现的字符

设串 T 采用堆式存储，设计一个算法，用统计串的形式给出串 T 中字符连续
出现的次数，例如‘aaabbaddddffc’的统计串为‘a3_b2_a1_d4_f2_c1’

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef int Status;
typedef struct {		//堆式分配定义
	char* ch = NULL;
	int length;
}HString;
void Strassign(HString& t)		//串的赋值
{
	int i = 0;
	char ch = ' ';
	while (ch != '\n') {
		t.ch = (char*)realloc(t.ch, ++i * sizeof(char));
		ch = getchar();
		t.ch[i - 1] = ch;
		t.length = i;
	}
	t.ch[i - 1] = '\0';
}

void Count(HString& t)
{
	int flag = 1;
	for (int i = 0; t.ch[i] != '\0'; i++)
	{
		char a = t.ch[i];
		//printf("%c", t.ch[i]);
		//printf("\n");
		if (a == t.ch[i + 1])
		{
			flag++;
			continue;
		}
		else
		{
			printf("%c%d", a, flag);
			if (t.ch[i + 1] != '\0')
				printf("_");
			flag = 1;
		}
	}
}
int main()
{
	HString t;
	printf("请输入字符串：\n");
	Strassign(t);
	printf("输出对应的统计串：\n");
	Count(t);
	return 0;
}