Min-Heap，基于零的数组C

min-heap with zero based array C++

本文关键字：数组 于零 Min-Heap      更新时间：2023-10-16

以下是我的程序，使用本书中具有标准逻辑的基于0的基于0的数组来构建一个小型。我正在使用2*i+1作为左儿童，而2*i+2为右子儿童使用，因为它的基于零的数组，但我仍然遇到了错误的输出。我想念什么？

#include <iostream>
#include <vector>
#include <algorithm>
using std::vector;
using std::cin;
using std::cout;
class HeapBuilder {
private:
    vector<int> data_;
    void WriteResponse() const {
        for (int i = 0; i < data_.size(); ++i) {
            cout << data_[i] << "n";
        }
    }
    void ReadData() {
        int n;
        cin >> n;
        data_.resize(n);
        for (int i = 0; i < n; ++i)
            cin >> data_[i];
    }
    void MinHeapSort(int index)
    {
        int left = (2 * index) + 1;
        int right = (2 * index) + 2;
        int smallest;
        if (left < data_.size() && data_[left] < data_[index])
            smallest = left;
        else
            smallest = index;
        if (right < data_.size() && data_[right] < data_[index])
            smallest = right;
        if (smallest != index)
        {
            swap(data_[smallest], data_[index]);
            MinHeapSort(smallest);
        }
    }
    void Heapify() {    
        for (int i = (data_.size() - 1) / 2; i >= 0; i--)
        {
            MinHeapSort(i);
        }
    }
public:
    void Solve() {
        ReadData();
        Heapify();
        WriteResponse();
    }
};
int main() {
    std::ios_base::sync_with_stdio(false);
    HeapBuilder heap_builder;
    heap_builder.Solve();
    return 0;
}

用

替换if (right < data_.size() && data_[right] < data_[index]) 
if (right < data_.size() && data_[right] < data_[smallest])

有效的，愚蠢的错误。

相关文章：