自定义列表
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>啦啦啦</title>
</head>
<body>
<!-- 图片 alt提示文本（当图片不显示的时候，显示alt） -->
<img src="../素材/图片/good luck.jpg" alt="幸运女孩"title="luck" width="300"height="300"/>
<!-- 超链接 -->
<p><a href="../素材/图片/bocai.jpg"title="俊博"target="_blank">junbo</a></p>
<!-- 圈c -->
©
<!-- 无序列表 -->
<ul type="square">
<li>习就阿富汗</li>
<li>习就阿富汗</li>
</ul>
<!-- 有序列表 -->
<ol type="1"start="3">
<li>春夏秋冬</li>
<li>愿你安好</li>
</ol>
<!-- 自定义列表 -->
<dl>
<dt>帮助中心</dt>
<dd>购物指南</dd>
<dd>订单操作</dd>
<dd>账户管理</dd>
</dl>
<!-- 文本加粗标签 -->
<strong>爱你麻麻</strong>
<!-- 文本倾斜标签 -->
<p><em>麻麻爱我</em></p>
<!-- 下划线 -->
<ins>好的</ins>
<!-- 删除线 -->
<p><del>还有两年呐</del></p>
<!-- 上标（2的三次方） -->
2<sup>3</sup>
<!-- 下标（水的化学式H20） -->
H<sub>2</sub>O
<!-- 锚点id="sd"（回到顶部） -->
<p id="sd">
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
{
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
{
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
{
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
{
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
{
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
{
int weight;
int parent;
int LChild;
int RChild;
}HTNode,HuffmanTree[M+1];
typedef char *HuffmanCode[N+1];
void CrtHuffmanTree(HuffmanTree ht,int w[],int n)//构造哈夫曼树ht[M+1],w[]存放n个权值
{
int i,k,Lnode,Rnode,Min1,Min2,max=0;
int m=2*n-1;
for(i=1;i<=n;i++) //叶子结点初始化
{
ht[i].weight=w[i];
ht[i].parent=0;
ht[i].LChild=0;
ht[i].RChild=0;
}
//ht[i]={ w[i],0,0,0};
for(i=n+1;i<=m;i++) //非叶子结点初始化
//ht[i]={0,0,0,0};
{
{</p>
<a href="#sd">锚点</a>
</body>
</html>