哈夫曼树与哈夫曼编码实现（C与java）

C

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>

typedef struct HTNode {
	int weight;
	int parent;
	int left;
	int right;
}HTNode;

typedef struct HTree {
	HTNode* data;
	int size;
}HTree;

void select(HTree* HT, int end, int* pMinIndex1, int* pMinIndex2);
HTree* createHTree(int* weight, int n);
void preOrder(HTree* HT, int rootIndex);
void DestroyHT(HTree* HT);
char** createHTCode(HTree* HT);

int main(void) {
	int weight[8] = { 5,29,7,8,14,23,3,11 };
	HTree* HT = createHTree(weight, 8);
	preOrder(HT, HT->size - 1);
	printf("\n");
	char** HC = createHTCode(HT);
	for (int i = 0; i < HT->size - 1; i++) {
		printf("%d 编码为：%s\n", HT->data[i].weight, HC[i]);
	}
	return 0;
}

HTree* createHTree(int* weight, int n) {
	//初始化
	HTree* HT = (HTree*)malloc(sizeof(HTree));
	if (HT == NULL)		return;
	HT->data = (HTNode*)malloc(sizeof(HTNode) * (2 * n - 1));
	HT->size = 2 * n - 1;

	for (int i = 0; i < 2 * n - 1; i++) {
		if (i < n)	HT->data[i].weight = weight[i];
		HT->data[i].parent = -1;
		HT->data[i].left = -1;
		HT->data[i].right = -1;
	}

	//创建树
	for (int i = n; i < 2 * n - 1; i++) {
		int minIndex1, minIndex2;
		//选择，找到最小值与次小值的位置
		select(HT, i - 1, &minIndex1, &minIndex2);
		//删除
		HT->data[minIndex1].parent = i;
		HT->data[minIndex2].parent = i;
		//合并
		HT->data[i].left = minIndex1;
		HT->data[i].right = minIndex2;
		HT->data[i].weight = HT->data[minIndex1].weight + HT->data[minIndex2].weight;
	}
	return HT;

}
void select(HTree* HT, int end, int* pMinIndex1, int* pMinIndex2) {
	int min1 = INT_MAX;
	for (int i = 0; i <= end; i++) {
		if (HT->data[i].parent == -1 && HT->data[i].weight < min1) {
			min1 = HT->data[i].weight;
			*pMinIndex1 = i;
		}
	}
	int min2 = INT_MAX;
	for (int i = 0; i <= end; i++) {
		if (HT->data[i].parent == -1 && HT->data[i].weight < min2
			&& i!=*pMinIndex1) {
			min2 = HT->data[i].weight;
			*pMinIndex2 = i;
		}
	}
}
void preOrder(HTree* HT, int rootIndex) {
	if (rootIndex == -1)	return;
	printf("%d ", HT->data[rootIndex].weight);
	preOrder(HT, HT->data[rootIndex].left);
	preOrder(HT, HT->data[rootIndex].right);
}
char** createHTCode(HTree* HT) {
	int n = (HT->size + 1) / 2;
	char** HC = (char**)malloc(sizeof(char*) * n);
	char* tmp = (char*)malloc(sizeof(char*) * n);
	tmp[n - 1] = '\0';
	//逐个求n个字符的哈夫曼编码
	for (int i = 0; i < n; i++) {
		int pos = n - 2;
		int cur = i;
		int parent = HT->data[i].parent;
		while (parent != -1) {
			if (HT->data[parent].left == cur) {
				tmp[pos--] = '0';
			}
			else {
				tmp[pos--] = '1';
			}
			cur = parent;
			parent = HT->data[parent].parent;
		}
		HC[i] = (char*)malloc(sizeof(char) * (n - 1 - pos));
		strcpy(HC[i], &tmp[pos + 1]);
	}
	free(tmp);
	tmp = NULL;
	return HC;

}
void DestroyHT(HTree* HT) {
	free(HT->data);
	HT->data = NULL;
	HT->size = 0;
	free(HT);
	HT = NULL;
}

java 

import java.util.*;
import java.io.*;


public class Main {


    public static void main(String[] args) {
        int[] weight={ 5,29,7,8,14,23,3,11 };
        HTree htree = createHTree(weight);
        preOrder(htree, htree.size-1);
        System.out.println();
        String[] codes=createHTCode(htree);
        for(int i=0;i<weight.length;i++){
            System.out.printf("%d的编码为%s\n",htree.htNodes[i].weight, codes[i]);
        }
    }

    static class HTNode {
        int weight;
        int parent;
        int left;
        int right;
    }

    static class HTree {
        HTNode[] htNodes;
        int size;

    }

    public static HTree createHTree(int[] weight) {
        //初始化
        int n = weight.length;
        HTree htree = new HTree();
        htree.size = 2 * n - 1;
        htree.htNodes = new HTNode[htree.size];
        for(int i=0;i<htree.size;i++){
            htree.htNodes[i]=new HTNode();
        }
        for (int i = 0; i < htree.size; i++) {
            if (i < n) htree.htNodes[i].weight = weight[i];
            htree.htNodes[i].parent = -1;
            htree.htNodes[i].left = -1;
            htree.htNodes[i].right = -1;
        }

        for (int i = n; i < htree.size; i++) {
            int min1_min2_index[] = select(htree, i - 1);
            htree.htNodes[min1_min2_index[1]].parent = i;
            htree.htNodes[min1_min2_index[2]].parent = i;

            htree.htNodes[i].weight = htree.htNodes[min1_min2_index[1]].weight + htree.htNodes[min1_min2_index[2]].weight;
            htree.htNodes[i].left = min1_min2_index[1];
            htree.htNodes[i].right = min1_min2_index[2];
        }
        return htree;


    }

    public static int[] select(HTree htree, int end) {
        int[] min1_min2_index = new int[3];
        int min1 = Integer.MAX_VALUE;
        for (int i = 0; i <= end; i++) {
            if (htree.htNodes[i].weight < min1 && htree.htNodes[i].parent == -1) {
                min1 = htree.htNodes[i].weight;
                min1_min2_index[1] = i;
            }
        }
        int min2 = Integer.MAX_VALUE;
        for (int i = 0; i <= end; i++) {
            if (htree.htNodes[i].weight < min2 && htree.htNodes[i].parent == -1 && i != min1_min2_index[1]) {
                min2 = htree.htNodes[i].weight;
                min1_min2_index[2] = i;
            }
        }
        return min1_min2_index;
    }

    public static void preOrder(HTree htree, int rootIndex) {
        if (rootIndex == -1) return;
        System.out.print(htree.htNodes[rootIndex].weight + " ");
        preOrder(htree, htree.htNodes[rootIndex].left);
        preOrder(htree, htree.htNodes[rootIndex].right);
    }

    public static String[] createHTCode(HTree htree) {
        String[] codes = new String[htree.size];
        for( int i=0;i<codes.length;i++) codes[i]="";
        for (int i = 0; i < htree.size; i++) {
            int cur = i;
            int parent = htree.htNodes[i].parent;
            while (parent != -1) {
                if (htree.htNodes[parent].left == cur) codes[i] += "0";
                else codes[i] += "1";
                cur = parent;
                parent = htree.htNodes[parent].parent;
            }
        }
        return codes;
    }
}