笔记笔记笔记

#include<stdio.h>
#include<string.h>

void sort(int a[],int l,int r){
	int flag=1;
	for (int i = l;i <= r&&flag;++i) {
		flag = 0;
		for (int j = l;j < r - (i - l);++j) {
			if (a[j] > a[j + 1]) {
				flag = 1;
				int tem = a[j];
				a[j] = a[j + 1];
				a[j + 1] =tem;
			}
		}
	}
}

int main() {
	int n;
	char cc;
	scanf("%d",&n);
	int Huffnum = 0, Huffqueue[3000] = { 0 }, top = 0, q[3000] = {0};
	for (int i = 0;i < n;++i) {
		getchar();
		scanf("%c %d",&cc,&Huffqueue[top++]);
		q[top - 1] = Huffqueue[top - 1];
	}
	int head=0;
    sort(Huffqueue,head,n-1);//重点，事先要对该频率进行排序，吐血吐血。。。。。。。
    //排序用改良的冒泡比较方便，该题的测试案例大多为有序的
	while (top != head+1) {//队列的弹出
		int n1 = Huffqueue[head];
        Huffqueue[head]=0;
		int n2 = Huffqueue[++head];//出队
        Huffqueue[head]=0;
		Huffqueue[head] = n1 + n2;//入队
		sort(Huffqueue,head,n-1);
		Huffnum += n1 + n2;//Huffman值记录
	}
	int m;
	scanf("%d",&m);
	
	for(int k=0;k<m;k++) {
	char code[3000][66] = {0};
		int Ohuffnum = 0;	//求Huffman值
		for (int i = 0;i < n;++i) {
			getchar();
			scanf("%c %s",&cc,code[i]);
			Ohuffnum += (int)strlen(code[i]) * q[i];
		}
		//printf("%s\n",code[4-m-1]);
		if (Ohuffnum != Huffnum) {
			printf("No\n");//huffman值不相等判断huffman树不等
		}
		else if(Ohuffnum == Huffnum) {//判断是否存在前缀相等的情况
			int flag = 1;//判断当前元素是否有前缀
			for (int i = 0;i < n;++i) {
				for (int j = 0;j < n&& j != i ;++j) {//&& j != i
					if (strlen(code[i])<=strlen(code[j])&&strncmp(code[i], code[j],strlen(code[i])) == 0) {
						flag = 0;
						break;
					}
                    else if (strlen(code[i])>strlen(code[j])&&strncmp(code[i], code[j],strlen(code[j])) == 0) {
						flag = 0;
						break;
					}
				}
				if (!flag) break;
			}
			if (!flag)printf("No\n");
			else printf("Yes\n");
            //以下内容跟上边的效果一样，只不过是调试的时候我以为是判断出错了，所以找了其他的判断方法，没想到一样，/(ㄒoㄒ)/~~，可以忽略
//             int min=1;
//     for(int l = 0;l < n;++l){
//         if(min == 0)break;
//     for(int i=l+1;i<n;++i){
//         int m = strlen(code[l]);
//         int m1 = strlen(code[i]);
//         if(m >= m1)//一定不要忘记等于的情况
//             if(strncmp(code[i],code[l],m1) == 0){min = 0;break;}
//         else if(m1>m)
//             if(strncmp(code[l],code[i],m) == 0){min = 0;break;}
//     }
// 		}
//             if (min==0)printf("No\n");
//  			else printf("Yes\n");
	}
    }
	return 0;
}

//用队列且提前对数组排好序，可以在不建树的情况下算出Huffman编码长度
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int cmp(const void* a,const void* b){
	return *(int*)a-*(int*)b;
}
int main(){
	printf("kk");
	int n,m,r=0,h=0,huffsum=0,hs=0,f,i,j,k;
	printf("kk");
	scanf("%d",&n);
	int w[n],queue[n];
	char hc[9999][9999],c;
	for(i=0;i<n;i++){
		scanf(" %c%d",&c,&queue[r++]);
		w[r-1]=queue[r-1];
	}
	qsort(queue,n,sizeof(int),cmp);//排升序 
	while(r!=h+1){//直到留下一个结点元素作为根 
	    huffsum+=queue[h]+queue[h+1];
		queue[h+1]=queue[h]+queue[h+1];
		h++;
		qsort(queue+1,n-h,sizeof(int),cmp); 
	}
	scanf("%d",&m);
	for(i=0;i<m;i++){
		hs=0;
		for(j=0;j<n;j++){
			scanf(" %c %s",&c,hc[i]);
			hs+=strlen(hc[i])*w[i];
		}
		if(hs==huffsum){
			f=0;
			for(j=0;j<n;j++){
				for(k=j+1;k<n;k++){
					if((strlen(hc[j])<=strlen(hc[k]))&&(strncmp(hc[j],hc[k],strlen(hc[j]))==0)){
						f=1;
						break;
					}
					else if((strlen(hc[j])>strlen(hc[k]))&&(strncmp(hc[j],hc[k],strlen(hc[k]))==0)){
						f=1;
						break;
					}
				}
				if(f) break;
			}
			if(f) printf("No\n");
			else printf("Yes\n");
		}
		else{
			printf("No\n");
		}
	}
}