0x011C150A 处的第一机会错误(在 Project1.exe 中): 0xC0000005: 读取位置 0xDD2466E8 时发生访问冲突
0x011C150A 处的第一机会异常(在 Project1.exe 中): 0xC0000005: 读取位置 0xDD2466E8 时发生访问冲突。
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
typedef struct
{
unsigned int weight;
unsigned int parent;
unsigned int lChild;
unsigned int rChild;
}HTNode,*HuffmanTree;
typedef char * * HuffmanCode;
void select(HuffmanTree HT,int Count,int s1,int s2)
{
int i;
unsigned int temp1=0;
unsigned int temp2=0;
unsigned int temp3;
for(i=1;i<=Count;i++)
{
if(HT[i].parent==0)
{
if(temp1==0)
{
temp1=HT[i].weight;
s1=i;
}
else
{
if(temp2==0)
{
temp2=HT[i].weight;
s2=i;
if(temp2<temp1)
{
temp3=temp2;
temp2=temp1;
temp1=temp3;
temp3=s2;
s2=s1;
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
typedef struct
{
unsigned int weight;
unsigned int parent;
unsigned int lChild;
unsigned int rChild;
}HTNode,*HuffmanTree;
typedef char * * HuffmanCode;
void select(HuffmanTree HT,int Count,int s1,int s2)
{
int i;
unsigned int temp1=0;
unsigned int temp2=0;
unsigned int temp3;
for(i=1;i<=Count;i++)
{
if(HT[i].parent==0)
{
if(temp1==0)
{
temp1=HT[i].weight;
s1=i;
}
else
{
if(temp2==0)
{
temp2=HT[i].weight;
s2=i;
if(temp2<temp1)
{
temp3=temp2;
temp2=temp1;
temp1=temp3;
temp3=s2;
s2=s1;