小编joh*_*ily的帖子

我有一个大小为10的整数数组.我需要绘制完成的二叉树.现在我需要使用siftup过程插入其他三个元素.显示每个插入后的最大堆.

我不确定是什么显示每个插入后的最大堆.这是否意味着每次插入一个元素时我需要显示最大堆的大小？

定义(最大堆)HEAP(X)设X是一个完全有序的集合.X上的堆是空的,∅,或者它是一个完整的二叉树,t,包括nt≥1个节点到每个节点,其中X的值被分配,使得:节点i的值≤节点i的父节点的值,i = 2,3,...,nt.堆的大小是树中的节点数.当且仅当其大小为0时,堆为空.

max heap的定义是这样的,但对我来说看起来有点模棱两可.

    int [] queue1 = {4,7,2,9,12,35,8,49};
    int [] queue2 = {24,53,6,19,41,71,1,68,11,32,99}        
    int[]mergeQ = new int[queue1.length + queue2.length];

    for(int i=0; i < queue1.length; i++ )
    {

      mergeQ[i*2] = queue1[i];       
      mergeQ[i*2+1] = queue2[i];  
    }
    for(int i=0; i < mergeQ.length; i++) {            
        System.out.print(mergeQ[i]+",");
    }

产量:4,24,7,53,2,6,9,19,12,41,35,71,8,1,49,68,0,0,0

如何打印出queue2的其余元素.

    String checkAvailable_flight = String.format("SELECT Flightid, flightdate,"
            + " origin, destination FROM flight"
            + " WHERE  Flightdate::Date = %s  AND origin = %s"
            + " AND destination = %s;", date_, origin_, destination_);

    ResultSet rs = stmt.executeQuery(checkAvailable_flight);

    if (!rs.next()) {

        System.out.println("no data inserted");
    } else {

        do {
            int flightid = rs.getInt("flightid");
            String date = rs.getString("flightdate");
            String origin = rs.getString("origin");
            String destination = rs.getString("destination");

            System.out.printf("%-10d %5s %5s %7s\n",flightid, date, origin, destination);

        } while (rs.next());
    }

发生错误:

SQLException : ERROR: operator does not …