Posted on 2006-09-08 23:25
oyjpart 閱讀(787)
評(píng)論(3) 編輯 收藏 引用
?
//
說(shuō)實(shí)話?我還是挺喜歡HEAP這個(gè)數(shù)據(jù)結(jié)構(gòu)的?寫(xiě)個(gè)類的HEAP吧?呵呵
//
by?Optimistic
//
本程序是大根堆的操作集合?以及堆排序?優(yōu)先級(jí)隊(duì)列的堆實(shí)現(xiàn)
#include?
<
string
.h
>
#include?
<
iostream
>
using
?
namespace
?std;
template?
<
typename?T
>
class
?MaxHeap????????????????
//
大根堆?(本程序使用下標(biāo)與結(jié)點(diǎn)名相同的格式)
{
public
:
?MaxHeap(
int
?MaxHeapSize?
=
?
10
);
?
~
MaxHeap()
{delete?[]?heap;}
?
int
?Size()
{
return
?heapSize;}
?MaxHeap
<
T
>&
?Insert(
const
?T
&
?x);
?MaxHeap
<
T
>&
?Delete(T
&
?x);
?
void
?MakeHeap(T?
*
?a,?
int
?size,?
int
?ArraySize);
?T?Max()
?
{
??
if
(heapsize?
>
?
0
)?????
//
判溢出
??
return
?heap[
1
];
?}
private
:
?T
*
?heap;
?
int
?heapSize;
?
int
?MaxSize;?
}
;
template?
<
typename?T
>
MaxHeap
<
T
>
::MaxHeap(
int
?MaxHeapSize)?????????
{
?MaxSize?
=
?MaxHeapSize;
?heap?
=
?
new
?T[MaxSize
+
1
];
?heapSize?
=
?
0
;
}
template?
<
typename?T
>
MaxHeap
<
T
>&
?MaxHeap
<
T
>
::Insert(
const
?T
&
?x)?
//
堆的插入?由葉結(jié)點(diǎn)向上找位置?在sort中是不需要插入的
{
?
if
(heapSize?
<
?MaxSize)????
?
{
??heapSize
++
;
??
int
?i?
=
?heapSize,?ic?
=
?i
/
2
;
??
while
(ic?
>=
?
1
)
??
{
???
if
(x?
<=
?heap[ic])?
break
;
???heap[i]?
=
?heap[ic];
???i?
=
?ic;
???ic?
=
?i?
/
?
2
;
??}
??heap[i]?
=
?x;
?}
?
return
?
*
this
;
}
template?
<
typename?T
>
MaxHeap
<
T
>&
?MaxHeap
<
T
>
::Delete(T
&
?x)???????
//
堆的刪除?即根結(jié)點(diǎn)的刪除?從上到下
{
?
//
在操作上相當(dāng)與對(duì)最后一個(gè)結(jié)點(diǎn)從上到下的插入
?
if
(heapSize?
>
?
0
)
?
{
??x?
=
?heap[
1
];
??T?y?
=
?heap[heapSize
--
];
??
int
?i?
=
?
1
,?ic?
=
?
2
;??????????????
//
i記錄當(dāng)前查詢結(jié)點(diǎn)?ic記錄其子結(jié)點(diǎn)
??
while
(ic?
<=
?heapSize)???????????????
??
{
???
if
(ic
+
1
?
<=
?heapSize?
&&
?heap[ic]?
<
?heap[ic
+
1
])?ic
++
;
???
if
(y?
>=
?heap[ic])?
break
;
???heap[i]?
=
?heap[ic];
???i?
=
?ic;
???ic?
=
?
2
*
i;
??}
??heap[i]?
=
?y;
?}
?
return
?
*
this
;
}
template?
<
typename?T
>
void
?MaxHeap
<
T
>
::MakeHeap(T?
*
?a,?
int
?size,?
int
?ArraySize)?
//
建堆：把數(shù)組堆化并處理成大根堆
{
?
//
堆化
?delete?[]?heap;
?heap?
=
?
new
?T[size
+
1
];
?memcpy(heap,?a,?(size
+
1
)
*
sizeof
(T));??????
//
此處不要忘記乘sizeof(T)
?heapSize?
=
?size;
?MaxSize?
=
?ArraySize;
?
//
處理堆
?
int
?i?
=
?heapSize
/
2
;
?
for
(;?i?
>=
?
1
;?i
--
)????????????????????
//
從小到上依次調(diào)整
?
{
??T?y?
=
?heap[i];
??
int
?ic?
=
?
2
*
i;
??
while
(ic?
<=
?heapSize)?
??
{
???
if
(ic
+
1
?
<=
?heapSize?
&&
?heap[ic
+
1
]?
>
?heap[ic])?ic
++
;
???
if
(y?
>=
?heap[ic])?
break
;
???heap[ic
/
2
]?
=
?heap[ic];
???ic?
=
?
2
*
ic;
??}
??heap[ic
/
2
]?
=
?y;
?}
}
template?
<
typename?T
>
void
?HeapSort(T?
*
?a,?
int
?n)
{
?MaxHeap
<
T
>
?H(
0
);
?H.MakeHeap(a,?n,?n);
?T?x;
?
for
(
int
?i?
=
?n;?i?
>=
?
1
;?i
--
)
?
{
??H.Delete(x);
??a[i]?
=
?x;
?}
}
int
?main()
{
//
?freopen("heap.in",?"r",?stdin);
?
int
?size,?i,?
*
?a;
?printf(
"
Please?input?the?size?of?array:\n
"
);
?scanf(
"
%d
"
,?
&
size);
?a?
=
?
new
?
int
[size
+
1
];
?printf(
"
Please?input?the?array?to?be?sorted:\n
"
);
?
for
(i
=
1
;?i
<=
size;?i
++
)
??scanf(
"
%d
"
,?
&
a[i]);
?HeapSort(a,?size);
?
for
(i
=
1
;?i
<=
size;?i
++
)
??printf(
"
%4d
"
,?a[i]);
?printf(
"
\n
"
);
?system(
"
Pause
"
);
?
return
?
0
;
}