5.25每日总结

通过昨天的努力，今天的软件已经弄得

差不多了，很快就可以完美完成。

下面还有一些函数：

函数一：

public int read_bill4(String month) throws Exception {

    Connection conn = null;
    Statement state = null;
    ResultSet find = null;

    int temp = 0;
    try {
        conn = DBOpenHelper.getConnect();
        state = conn.createStatement();

        String sql = "select *FROM BillTable " +
                " WHERE account="+"'"+(String)User.a+"'"+
                " AND dayss>='2023-"+month+"-00'" +
                " AND dayss<='2023-"+month+"-31'";
        find = state.executeQuery(sql);

        cy=0.0;
        yul=0.0;
        jt=0.0;
        yil=0.0;
        gw=0.0;
        qt=0.0;

        while (find.next()) {

            if(find.getString(5).equals("餐饮")) cy=cy+Double.parseDouble(find.getString(3));


            if(find.getString(5).equals("娱乐")) yul=yul+Double.parseDouble(find.getString(3));

            if(find.getString(5).equals("交通")) jt=jt+Double.parseDouble(find.getString(3));

            if(find.getString(5).equals("医疗")) yil=yil+Double.parseDouble(find.getString(3));

            if(find.getString(5).equals("购物")) gw=gw+Double.parseDouble(find.getString(3));

            if(find.getString(5).equals("其他")) qt=qt+Double.parseDouble(find.getString(3));
        }


    } catch (Exception e) {
        e.printStackTrace();
    } finally {
        DBOpenHelper.release(conn, state, find);
    }

    return temp;
}

函数二：

public int paixu(){
        Double buf;
        String buff;
        for (int i=0; i<10-1; ++i)  //比较n-1轮
        {
            for (int j=0; j<10-1-i; ++j)  //每轮比较n-1-i次,
            {
                if (alljine[j] <= alljine[j+1])
                {
                    buf = alljine[j];
                    alljine[j] = alljine[j+1];
                    alljine[j+1] = buf;

                    buff = allusers[j];
                    allusers[j] = allusers[j+1];
                    allusers[j+1] = buff;
                }
            }
        }

        return 0;
    }


    public int defen(){
        int m=0;
        for(int i=0;i<10;i++){
            alldefen[i]=(1/alljine[i])*100+(m*2.5);
            m++;
        }

        Double buf;
        String buff;
        Double bufff;

        for (int i=0; i<10-1; ++i)  //比较n-1轮
        {
            for (int j=0; j<10-1-i; ++j)  //每轮比较n-1-i次,
            {
                if (alldefen[j] <= alldefen[j+1])
                {
                    bufff = alldefen[j];
                    alldefen[j] = alldefen[j+1];
                    alldefen[j+1] = bufff;

                    buf = alljine[j];
                    alljine[j] = alljine[j+1];
                    alljine[j+1] = buf;

                    buff = allusers[j];
                    allusers[j] = allusers[j+1];
                    allusers[j+1] = buff;
                }
            }
        }



        return 0;
    }

}