• 数据库顺序查询


    public class Conn {
        static Connection con;
        static Statement sql;
        static ResultSet res;
        public Connection getConnecvtion() {
            try {
                Class.forName("com.mysql.jdbc.Driver");
                System.out.println("数据库驱动加载成功");
            } catch (ClassNotFoundException e) {
                // TODO: handle exception
                e.printStackTrace();
            }
            try {
    //            con = DriverManager.getConnection("jdbc:mysql:" + "//10.21.22.91:3306/demo?useUnicode=true&characterEncoding=UTF-8&useSSL=false&autoReconnect=true&failOverReadOnly=false","root","123456");
                con = DriverManager.getConnection("jdbc:mysql://localhost:3306/test","root","123456");
                System.out.println("数据库连接成功");
            } catch (SQLException e) {
                // TODO: handle exception
                e.printStackTrace();
            }
            return con;
        }
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            Conn c = new Conn();
            c.getConnecvtion();
            try {
                sql = con.createStatement();
                res = sql.executeQuery("select * from tb_stu");
                while (res.next()) {
                    String id = res.getString("id");
                    String sex = res.getString("sex");
                    String birthday = res.getString("birthday");
                    System.out.println(birthday);
                    String name = res.getString("name");
                    System.out.print("编号:"+ id);
                    System.out.print("姓名:"+ name);
                    System.out.print("性别:"+ sex);
                    System.out.println("生日:"+ birthday);
                }
            } catch (Exception e) {
                // TODO: handle exception
                e.printStackTrace();
            }
        }
    }
  • 相关阅读:
    Educational Codeforces Round 49 (Rated for Div. 2)
    Codeforces Round #506 (Div. 3)
    multiset
    C++中substr函数的用法
    7.30 背包问题
    7.29 dp动态规划
    7.27 图论 存图 前向星 最短路 dijstra算法 SPFA算法
    7.26 搜索进阶(状压搜索,迭代加深搜索)
    7.23 深搜广搜
    7.24 二分搜索
  • 原文地址:https://www.cnblogs.com/dulute/p/10691773.html
Copyright © 2020-2023  润新知