算法系列15天速成——第十三天 树操作【下】

//下标交换
                            var tempIndex = minIndex1;
                            minIndex1 = minIndex2;
                            minIndex2 = tempIndex;

continue;
                        }
                    }
                    if (minNode1 != null && minNode2 != null)
                    {
                        if (huffman[i].weight <= minNode1.weight)
                        {
                            //将min1临时转存给min2
                            minNode2 = minNode1;
                            minNode1 = huffman[i];

//记录在数组中的下标
                            minIndex2 = minIndex1;
                            minIndex1 = i;
                        }
                        else
                        {
                            if (huffman[i].weight < minNode2.weight)
                            {
                                minNode2 = huffman[i];

minIndex2 = i;
                            }
                        }
                    }
                }
            }
        }
        #endregion

#region 赫夫曼编码
        /// <summary>
/// 赫夫曼编码
/// </summary>
/// <param></param>
/// <param></param>
/// <param></param>
        public string[] HuffmanCoding(HuffmanTree[] huffman, int leafNum)
        {
            int current = 0;

int parent = 0;

string[] huffmanCode = new string[leafNum];

（编辑：焦作站长网）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!