棧：一種只能在一端進(jìn)行插入和刪除的特殊線性表，按照先進(jìn)后出的方式組織數(shù)據(jù)，先進(jìn)入的數(shù)據(jù)被壓入棧底，最后的數(shù)據(jù)被壓入棧頂，需要讀取數(shù)據(jù)時從棧頂開始彈出數(shù)據(jù)

隊列：一種只能在一端進(jìn)行數(shù)據(jù)的插入及另一端進(jìn)行數(shù)據(jù)的刪除的特殊線性表，按照先進(jìn)先出的方式組織數(shù)據(jù)

堆：N個元素{k₁, k₂, k₃, k₄, k₅, k₆ ... k_n}組成的集合，若滿足下列關(guān)系之一則可稱之為堆：

k_i <= k_2i 且 k_i <= k_2i+1, (i = 1, 2, 3 ... n/2)

k_i >= k_2i 且 k_i >= k_2i+1, (i = 1, 2, 3 ... n/2)

小根堆的圖示如下：

?

棧的簡單實現(xiàn)：

// Author: Waihui Zheng // 棧 #include <iostream> #include <assert.h>namespace my_space {template <typename T> class stack { public:stack() : _top_index(0) {}~stack() {}void push(const T& value) {assert(_top_index < MAXN);_array[_top_index++] = value;}void pop() {assert(_top_index > 0);--_top_index;}T& top() {assert(_top_index > 0);return _array[_top_index - 1];}const T& top() const {assert(_top_index > 0);return _array[_top_index - 1];}bool empty() const {return _top_index == 0;}bool full() const {return _top_index == MAXN;}private:static const int MAXN = 1000;T _array[MAXN];int _top_index; };}int main() {my_space::stack<int> st;st.push(7);st.push(8);st.push(9);while (!st.empty()) {std::cout << st.top() << " ";st.pop();}std::cout << std::endl;return 0; }

?

隊列的簡單實現(xiàn)：

// Author: Waihui Zheng // 隊列 #include <iostream> #include <assert.h>namespace my_space {template <typename T> class queue { public:queue() : _front_index(0), _last_index(0) {}~queue() {}void push(const T& value) {assert(!full());_array[_front_index] = value;_front_index = (_front_index + 1) % MAXN;}void pop() {assert(!empty());_last_index = (_last_index + 1) % MAXN;}T& front() {assert(!empty());int index = _front_index - 1;if (index < 0) {index += MAXN;}return _array[index];}const T& front() const {assert(!empty());int index = _front_index - 1;if (index < 0) {index += MAXN;}return _array[index];}T& back() {assert(!empty());return _array[_last_index];}const T& back() const {assert(!empty());return _array[_last_index];}bool empty() const {return _front_index == _last_index;}bool full() const {return (_front_index + 1) % MAXN == _last_index;}private:static const int MAXN = 1000;T _array[MAXN];int _front_index; // 前方插入int _last_index; // 后方刪除 };}int main() {my_space::queue<int> q;q.push(7);q.push(8);q.push(9);while (!q.empty()) {std::cout << q.back() << " ";q.pop();}std::cout << std::endl;return 0; }

堆的簡單實現(xiàn)：

// Author: Waihui Zheng // 堆 // N個元素{k1, k2, k3, k4, k5, k6 ... kn}組成的集合，若滿足下列關(guān)系之一則可稱之為堆 // 1. ki <= k2i 且 ki <= k2i+1, (i = 1, 2, 3 ... n/2) // 2. ki >= k2i 且 ki >= k2i+1, (i = 1, 2, 3 ... n/2) #include <iostream> #include <algorithm> #include <assert.h>namespace my_space {template <typename T> class MaxHeap { public:MaxHeap() : _length(0) {}~MaxHeap() {}// 插入操作，則是將將元素追加于數(shù)據(jù)尾部，然后向上調(diào)堆void push(const T& value) {// 下標(biāo)從1開始，最多只能存放MAXN - 1個元素assert(_length < MAXN - 1);_array[++_length] = value;adjust_heap_up(_array, _length);}// 堆的刪除操作，則是將第一個元素刪除，將最后一個元素放于第一個位置，然后向下調(diào)堆void pop() {assert(_length > 0);std::swap(_array[1], _array[_length]);--_length;if (_length <= 0) {return ;}adjust_heap_down(_array, 1, _length);}void print() {for (int i = 1; i <= _length; ++i) {std::cout << _array[i] << " ";}std::cout << std::endl;}// 便于理解，依然元素小標(biāo)從1開始void heap_sort(T* array, int length) {for (int root = length / 2; root >= 1; --root) {adjust_heap_down(array, root, length);}for (int last_index = length; last_index > 1;) {std::swap(array[1], array[last_index]);--last_index;adjust_heap_down(array, 1, last_index);}}private:// 向下調(diào)堆，用于刪除操作void adjust_heap_down(T* data, int root_index, int last_index) {T temp = data[root_index];int cur_index = root_index * 2;while (cur_index <= last_index) {// 選取子節(jié)點鍵值最大的節(jié)點if (cur_index < last_index && data[cur_index + 1] > data[cur_index]) {++cur_index;}// 若當(dāng)前節(jié)點的鍵值 小于等于 父節(jié)點的鍵值，說明調(diào)堆成功并結(jié)束if (data[cur_index] <= temp) {break;}// 當(dāng)前節(jié)點鍵值大于父節(jié)點，當(dāng)前鍵值上移data[root_index] = data[cur_index];root_index = cur_index;cur_index = 2 * root_index;}data[root_index] = temp;}// 向上調(diào)堆，用于插入操作，元素下標(biāo)從1開始void adjust_heap_up(T* data, int value_index) {T temp = data[value_index];for (int cur_index = value_index / 2; cur_index >= 1; value_index = cur_index, cur_index /= 2) {if (data[cur_index] >= temp) {break;}data[value_index] = data[cur_index];}data[value_index] = temp;}private:static const int MAXN = 1000;T _array[MAXN]; // 為便于理解，數(shù)組第一個元素從下標(biāo)1開始int _length; };}int main() {my_space::MaxHeap<int> max_heap;int a[] = {88888, 3, 1, 5, 7, 10, 2};max_heap.heap_sort(a, sizeof(a) / sizeof(int) - 1);for (int i = 0; i < sizeof(a) / sizeof(int); ++i) {std::cout << a[i] << " ";}std::cout << std::endl;max_heap.push(5);max_heap.push(10);max_heap.push(13);max_heap.push(4);max_heap.push(18);max_heap.print();max_heap.pop();max_heap.print();return 0; }

?

轉(zhuǎn)載于:https://www.cnblogs.com/bugfly/p/5192012.html

總結(jié)

以上是生活随笔為你收集整理的栈队列堆的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。