国产午夜精品久久久久免费视,亚洲国产欧美国产综合久久,一本一道久久a久久精品综合

循环队列实现

Fri, 19 Sep 2008 11:52:00 GMT

1//数据�l�构队列��单实玎ͼ�循环队列�Q?/span>
2#ifndef QUEUE_H
3#define QUEUE_H
4
5template<class T>
6class Queue
7{
8public:
9    Queue(int maxsize=50);
10    virtual ~Queue();
11    bool IsFull(){return (rear+1)%MaxSize==front?true:false;}//满？
12    bool IsEmpty(){return front==rear?true:false;};//�I�？
13    Queue<T>& Push(const T& val);//向队��插入元�?/span>
14    Queue<T>& Pop(T& e);//从堆头删除元�?/span>
15    int Size(){return _Size;};//�q�回队列元素个数
16    T& Front();//�q�回对头元素
17    T& Back();//�q�回队尾元素
18
19private:
20    T *data;
21    int front,rear;
22    int MaxSize;
23    int _Size;
24};
25//------------------------------------------------
26template<class T>
27Queue<T>::Queue(int maxsize)
28{
29    data=new T[maxsize+1];
30    MaxSize=maxsize+1;
31    front=rear=_Size=0;
32
33}
34//------------------------------------------------
35template<class T>
36Queue<T>::~Queue()
37{
38    delete[] data;
39}
40//------------------------------------------------
41template<class T>
42Queue<T>& Queue<T>::Push(const T& val)
43{
44    if(IsFull()) throw exception("队列已满");
45    rear=(rear+1)%MaxSize;
46    data[rear]=val;
47    _Size++;
48    return *this;
49}
50//------------------------------------------------
51template<class T>
52Queue<T>& Queue<T>::Pop(T& e)
53{
54    if(IsEmpty()) throw exception("队列已空");
55    front=(front+1)%MaxSize;
56    e=data[front];
57    _Size--;
58    return *this;
59}
60//------------------------------------------------
61template<class T>
62T& Queue<T>::Front()
63{
64    if(IsEmpty()) throw exception("队列已空");
65    return data[(front+1)%MaxSize];
66
67}
68//------------------------------------------------
69template<class T>
70T& Queue<T>::Back()
71{
72    if(IsEmpty()) throw exception("队列已空");
73    return data[rear];
74
75}
76#endif

杨�{�?/a> 2008-09-19 19:52 发表评论

Fri, 19 Sep 2008 11:09:00 GMT

1//数据�l�构栈实玎ͼ��Z��链表�Q?/span>
2#ifndef STACKLIST_H
3#define STACKLIST_H
4//节点�l�构
5template<class T>
6class Node
7{
8    public:
9        Node(const T & val){data=val;next=NULL;}
10        T data;
11        Node<T> *next;
12};
13
14//栈实�?/span>
15template<class T>
16class Stack
17{
18public:
19    Stack();
20    virtual ~Stack();
21    bool IsEmpty();
22    Stack<T>& Push(const T &val);
23    Stack<T>& Pop(T &e);
24    T& GetTop() const{return Top->data;};
25    int Size() const {return _Size;};
26
27private:
28    int _Size;
29    Node<T>  *Top;
30
31};
32//-----------------------------------------------------------
33template<class T>
34Stack<T>::Stack()
35{
36    Top=NULL;
37    _Size=0;
38}
39
40//-----------------------------------------------------------
41template<class T>
42bool Stack<T>::IsEmpty()
43{    return !Top?true:false;
44
45}
46//-----------------------------------------------------------
47template<class T>
48Stack<T>::~Stack()
49{
50    Node<T>* move=NULL;
51    while(Top)
52    {
53        move=Top->next;
54        delete Top;
55        Top=move;
56    }
57
58}
59//-----------------------------------------------------------
60template<class T>
61Stack<T>& Stack<T>::Push(const T &val)
62{
63
64    Node<T> *NewNode = new Node<T>(val);
65    NewNode->next=Top;
66    Top=NewNode;
67    ++_Size;
68    return *this;
69}
70//-----------------------------------------------------------
71template<class T>
72Stack<T>& Stack<T>::Pop(T &e)
73{
74    if(Top==NULL) throw exception("栈下�?/span>");
75    e=Top->data;
76    Node<T> *p=Top;
77    Top=Top->next;
78    delete p;
79    --_Size;
80    return *this;
81}
82
83
84#endif

杨�{�?/a> 2008-09-19 19:09 发表评论

Fri, 19 Sep 2008 10:43:00 GMT

1//数据�l�构堆栈实现�Q�基于数�l�）(j��)
2#ifndef STACK_H
3#define STACK_H
4template<class T>
5class Stack
6{
7public:
8Stack(int maxsize=50);
9virtual ~Stack();
10bool IsEmpty();
11Stack<T>& Push(const T &val);
12Stack<T>& Pop(T &e);
13T& GetTop() const{return Data[Top];};
14int Size() const {return Top+1;};
15
16private:
17    T *Data;
18    int MaxSize;
19    int Top;
20
21};
22
23
24//-----------------------------------------------------------
25template<class T>
26Stack<T>::Stack(int maxsize)
27{
28MaxSize=maxsize;
29Data=new T[MaxSize];
30Top=-1;
31}
32
33//-----------------------------------------------------------
34template<class T>
35bool Stack<T>::IsEmpty()
36{    return Top==-1?true:false;
37
38}
39//-----------------------------------------------------------
40template<class T>
41Stack<T>::~Stack()
42{
43delete[] Data;
44}
45//-----------------------------------------------------------
46template<class T>
47Stack<T>& Stack<T>::Push(const T &val)
48{
49if(Top==MaxSize-1) throw exception("栈上�?/span>");
50Data[++Top]=val;
51return *this;
52}
53//-----------------------------------------------------------
54template<class T>
55Stack<T>& Stack<T>::Pop(T &e)
56{
57if(Top==-1) throw exception("栈下�?/span>");
58e=Data[Top--];
59return *this;
60}
61#endif

杨�{�?/a> 2008-09-19 18:43 发表评论

单向带头�l�点循环链表实现

Thu, 18 Sep 2008 12:54:00 GMT

摘要: 1 1#ifndef LIST_H 2#define LIST_H 3#include 4//链表节点 5template 6class ListNo... 阅读全文

杨�{�?/a> 2008-09-18 20:54 发表评论

Thu, 18 Sep 2008 09:20:00 GMT

关于�U�黑�?w��i)（r-b�?w��i)�?j��)的相兌��?/a>

杨�{�?/a> 2008-09-18 17:20 发表评论

Thu, 18 Sep 2008 09:17:00 GMT

二叉搜烦(ch��)�?w��i)实�?�l�承于二叉树(w��i))

  1#include "BinTree.h"
  2
  3template<class K,class E>
  4class BinSearchTree:public BinTree<E>
  5{
  6public:
  7    bool Search(const K &k,E &e);//以关键字K�q�行搜烦(ch��)�Q�结果返回到e�?/span>
  8    BinSearchTree<K,E>& Insert(const E &e);//��元素e插入到树(w��i)�?/span>
  9    BinSearchTree<K,E>& Delete(const K &k,E &e);//通过指定关键字k�q�行节点的删�?/span>
10
11};
12
13//----------------------------------------------------------
14template<class K,class E>
15bool BinSearchTree<K,E>::Search(const K &k,E &e)
16{
17
18BinTreeNode<E> *p=root;
19while(p)
20{
21if(k<p->data)
22p=p->LeftChild;
23else if(k>p->data)
24p=p->RightChild;
25else//扑ֈ�元素
26{
27e=p->data;
28return true;
29}
30}
31return false;
32}
33//----------------------------------------------------------
34template<class K,class E>
35BinSearchTree<K,E>& BinSearchTree<K,E>::Insert(const E &e)
36{
37
38BinTreeNode<E> *p=root,*pp=NULL;
39while(p)
40{
41pp=p;
42if(e<=p->data)
43p=p->LeftChild;
44else
45p=p->RightChild;
46}
47
48BinTreeNode<E> *NewNode=new BinTreeNode<E>(e);
49if(root)
50{
51if(e<=pp->data)
52pp->LeftChild=NewNode;
53else
54pp->RightChild=NewNode;
55}
56else
57  root=NewNode;
58return *this;
59}
60
61//----------------------------------------------------------
62template<class K,class E>
63BinSearchTree<K,E>& BinSearchTree<K,E>::Delete(const K &k,E &e)
64{
65BinTreeNode<E> *p=root,*pp=NULL;
66
67while(p&&p->data!=k)
68{pp=p;
69if(k<p->data)  p=p->LeftChild;
70else p=p->RightChild;
71}
72
73if(!p) {throw exception("没有扑ֈ�指定元素");}
74e=p->data;
75if(p->LeftChild&&p->RightChild)//p的左叛_��子均不�ؓ(f��)�I?/span>
76{
77BinTreeNode<E> *s=p->LeftChild,*ps=p;
78while(s->RightChild)
79{
80ps=s;
81s=s->RightChild;
82}
83
84p->data=s->data;
85p=s;
86pp=ps;
87}//if
88BinTreeNode<E> *c;
89if(p->LeftChild) c=p->LeftChild;
90else c=p->RightChild;
91
92if(p==root) root=c;
93else
94{
95
96if(p==pp->LeftChild) pp->LeftChild=c;
97else pp->RightChild=c;
98}
99delete p;
100
101return *this;
102}

杨�{�?/a> 2008-09-18 17:17 发表评论

Thu, 18 Sep 2008 09:14:00 GMT

摘要: 二叉�?w��i)实玎ͼ�主要是��?f��)�?ji��n)实��C��叉搜索树(w��i)时作为其父类�Q? 1//实现二叉�?w��i)数据结�?nbsp; 2#ifndef BINTREE_H 3#define BINTREE_H 4 5 6//定义节点�l�构 7template阅读全文

杨�{�?/a> 2008-09-18 17:14 发表评论

Wed, 17 Sep 2008 13:32:00 GMT

摘要: HBLT可用于实��C��先��队列�Q��ƈ可实��C��个优先��队列的合�q�操�? (如发现错误请留言) 1//高度优先左高�?HBLT)实现 2#ifndef HBLT_H 3#define HBLT_H 4#include 5//定义HBLT... 阅读全文

杨�{�?/a> 2008-09-17 21:32 发表评论

最大堆实现

Wed, 17 Sep 2008 11:49:00 GMT

摘要: 1//大顶堆数据结�?nbsp; 2#ifndef MAXHEAP_H 3#define MAXHEAP_H 4 5template 6class MaxHeap 7{ &nb... 阅读全文

杨�{�?/a> 2008-09-17 19:49 发表评论

链表�c?--转蝲

Wed, 18 Jun 2008 14:05:00 GMT

摘要: #ifndef LIST_H#define LIST_Htemplateclass list_item {public: list_item( elemtype, list_item* ); list_item(&nb... 阅读全文

杨�{�?/a> 2008-06-18 22:05 发表评论