1155 Heap Paths (30 分)大小堆的判断，根结点到各个叶结点的路径，dfs递归

自己写的不小心删了，，dfs不会写，不知道什么时候pop，
①判断大小堆，这个方法真好，不用单独写成函数论，，

    for (int i = 2; i <= n; i++) {
        if (a[i/2] > a[i]) isMin = 0;
        if (a[i/2] < a[i]) isMax = 0;
    }

按照习惯，我喜欢从堆底开始判断

    for (int i = n; i >= 2; i--) {
        if (a[i] < a[i/2]) isMin = 0;
        if (a[i] > a[i/2]) isMax = 0;
    }

②dfs算法
多加理解
有左孩子就push，没有左孩子了就一直pop

#include <iostream>
#include <vector>
using namespace std;
vector<int> v;
int a[1009], n, isMin = 1, isMax = 1;
void dfs(int index) {
    if (index * 2 > n && index * 2 + 1 > n) {
        if (index <= n) {
            for (int i = 0; i < v.size(); i++)
                printf("%d%s", v[i], i != v.size() - 1 ? " " : "\n");
        }
    } else {
        v.push_back(a[index * 2 + 1]);
        dfs(index * 2 + 1);
        v.pop_back();
        v.push_back(a[index * 2]);
        dfs(index * 2);
        v.pop_back();
    }
}
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    v.push_back(a[1]);
    dfs(1);
    for (int i = 2; i <= n; i++) {
        if (a[i/2] > a[i]) isMin = 0;
        if (a[i/2] < a[i]) isMax = 0;
    }
    if (isMin == 1)
        printf("Min Heap");
    else 
        printf("%s", isMax == 1 ? "Max Heap" : "Not Heap"); 
    return 0;
}