哈夫曼树andNqueen

哈夫曼树

结点结构

typedef struct {
	int weight;//结点权重
	int parent, left, right;//父结点、左孩子、右孩子
}HTNode, *HuffmanTree;

动态二维数组

typedef char ** HuffmanCode;

选择最小min

 void Select(HuffmanTree HT, int end, int *s1, int *s2)
{
	int min1, min2;
	//遍历数组初始下标为 1
	int i = 1;
	
	while (HT[i].parent != 0 && i <= end) {
		i++;
	}
	min1 = HT[i].weight;
	*s1 = i;
 
	i++;
	while (HT[i].parent != 0 && i <= end) {
		i++;
	}
	//对找到的两个结点比较大小，min2为大的，min1为小的
	if (HT[i].weight < min1) {
		min2 = min1;
		*s2 = *s1;
		min1 = HT[i].weight;
		*s1 = i;
	}
	else {
		min2 = HT[i].weight;
		*s2 = i;
	}
	//比较
	for (int j = i + 1; j <= end; j++)
	{
		//有父结点跳过
		if (HT[j].parent != 0) {
			continue;
		}
		//min1赋值新的结点的下标
		if (HT[j].weight < min1) {
			min2 = min1;
			min1 = HT[j].weight;
			*s2 = *s1;
			*s1 = j;
		}
		//min2赋值为新的结点的位置下标
		else if (HT[j].weight >= min1 && HT[j].weight < min2) {
			min2 = HT[j].weight;
			*s2 = j;
		}
	}
}

创建树

void CreateHuffmanTree(HuffmanTree *HT, int *s, int n)

{
	if (n <= 1) return; // 如果只有一个编码就相当于0
	int m = 2 * n - 1; 
	*HT = (HuffmanTree)malloc((m + 1) * sizeof(HTNode)); // 0号位置不用
	HuffmanTree p = *HT;
	// 初始化所有结点
	for (int i = 1; i <= n; i++)
	{
		(p + i)->weight = *(w + i - 1);
		(p + i)->parent = 0;
		(p + i)->left = 0;
		(p + i)->right = 0;
	}
	//从树组的下标 n+1 开始初始化哈夫曼树中除叶子结点外的结点
	for (int i = n + 1; i <= m; i++)
	{
		(p + i)->weight = 0;
		(p + i)->parent = 0;
		(p + i)->left = 0;
		(p + i)->right = 0;
	}
	//构建哈夫曼树
	for (int i = n + 1; i <= m; i++)
	{
		int s1, s2;
		Select(*HT, i - 1, &s1, &s2);
		(*HT)[s1].parent = (*HT)[s2].parent = i;
		(*HT)[i].left = s1;
		(*HT)[i].right = s2;
		(*HT)[i].weight = (*HT)[s1].weight + (*HT)[s2].weight;
	}
}

编码

void HuffmanCoding(HuffmanTree HT, HuffmanCode *HC, int n) {
	*HC = (HuffmanCode)malloc((n + 1) * sizeof(char *));
	char *cd = (char *)malloc(n * sizeof(char)); 
	cd[n - 1] = '\0';//字符串结束符
 
	for (int i = 1; i <= n; i++) {
	
		int start = n - 1;
		//当前结点在数组中的位置
		int c = i;
		
		int j = HT[i].parent;
		// 一直寻找到根结点
		while (j != 0) {
	
			if (HT[j].left == c)
				cd[--start] = '0';
			else
				cd[--start] = '1';
			//以父结点为孩子结点，继续朝树根的方向遍历
			c = j;
			j = HT[j].parent;
		}
		//跳出循环后，cd数组中从下标 start 开始
		(*HC)[i] = (char *)malloc((n - start) * sizeof(char));
		strcpy_s((*HC)[i],4, &cd[start]);
		
	}

	free(cd);
}

//打印函数

void PrintHuffmanCode(HuffmanCode htable, int *s, int n)
{
	printf("Huffman code : \n");
	for (int i = 1; i <= n; i++)
		printf("%d code = %s\n", w[i - 1], htable[i]);
}
int main()
{
	int s[4] = { 7, 4, 1, 6};
	int n = 4;
	HuffmanTree htree;
	HuffmanCode htable;
	CreateHuffmanTree(&htree, w, n);
	HuffmanCoding(htree, &htable, n);
	PrintHuffmanCode(htable, w, n);
	return 0;
}

N – QUeen – DFS

定义结构

int n;
int cnt = 0;
int a[20];

检查函数

int check(int x, int y) {
	int i;

	for (i = 1; i <= x; i++) {

		if (a[i] == y) {
			return 0;
		}

		if (i + a[i] == x + y) {
			return 0;
		}

		if (a[i] - i == y - x) {
			return 0;
		}
	}

	return 1;


}

dfs

void dfs(int cur) {
	if (cur == n + 1) {
		cnt++;
		return ;


	}

	int i;

	for (i = 1; i <= n; i++) {

		if (check(cur, i)) {
			a[cur] = i;
			dfs(cur + 1);
			a[cur] = 0;

		}
	}

	return;


}

main

int main() {
	scanf("%d", &n);
	int i;

	for (i = 0; i < 20; i++) {

		a[i] = 0;

	}

	dfs(1);
	printf("%d", cnt);

	return 0;
}