堆基本操作实现最大堆
4 浏览量
2021-01-20
07:07:45
上传
评论
收藏 40KB PDF 举报
堆基本操作实现最大堆堆基本操作实现最大堆
代码如下:
/**
* 实现最大堆
*
*/
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
const int M = 10003;
//定义数据节点
class dNode{
public:
string name;
int age;
double score;
dNode():name(“no name”), age(0), score(0.0){}
dNode(string name, int age, double score):name(name), age(age), score(score){}
bool operator < (const dNode & d){
return score < d.score;
}
bool operator > (const dNode &d){
return score > d.score;
}
bool operator = (const dNode &d){
name = d.name;age=d.age;score=d.score;
}
bool operator == (const dNode &d){
return name == d.name && age == d.age && score == d.score;
}
void swap(dNode & a, dNode & b){
dNode tmp = a;
a = b;
b = tmp;
}
void show(){
cout << “***************” << endl;
cout << “name: ” << name << endl;
cout << “age: ” << age << endl;
cout << “score: ” << score << endl;
}
};
//定义堆
template<class T>
class Heap{
public:
dNode h[M];
void heapify(int cur);
int n;
//数组下标从0开始
int L(int i){return (i << 1) + 1;}
int R(int i){return (i << 1) + 2;}
int P(int i){return (i – 1) >> 1;}
public:
Heap():n(0){}
评论0