zoukankan      html  css  js  c++  java
  • 地铁计费器 计应192(西) 7组 程腾飞

    1.设计一个简易的地铁计费系统

    乘坐地铁需要记录乘坐时间,离开时间,费用扣款,并且显示详细的信息

    2.(乘坐编号,kaishi乘坐时间,Onuse是否使用)

    数据库连接代码:`

    package wbsys.entity;

    import java.sql.*;

    public class Lianjie {

    private String DBDriver;

    private String DBURL;

    private String DBUser;

    private String DBPass;

    private Connection conn = null;

    private Statement stmt = null;

    public Lianjie() {

    DBDriver = “com.mysql.cj.jdbc.Driver”;

    DBURL = “jdbc:mysql://localhost:3306/rj2018?serverTimezone=UTC&characterEncoding=utf-8”;

    DBUser = “root”;//用户名

    DBPass = “1234”;

    try {

    Class.forName(DBDriver);

    } catch (Exception e) {

    e.printStackTrace();

    }

    try {

    conn = DriverManager.getConnection(DBURL, DBUser, DBPass);//取得连接对象

    stmt = conn.createStatement();//取得SQL语句对象

    } catch (Exception e) {

    e.printStackTrace();

    }

    }

    public Connection getMyConnection() {

    return conn;

    }

    public Statement getMyStatement() {

    return stmt;

    }

    public void closeMyConnection() {//关闭数据库连接

    try {

    stmt.close();

    conn.close();

    } catch (SQLException e) {

    e.printStackTrace();

    }

    }

    public String toString() {

    return “数据库驱动程序” + DBDriver + “,链接地址” + DBURL + “,用户名” + DBUser + “,密码” + DBPass;

    }

    public Connection con() {

    Connection con = null;

    try {

    con = DriverManager.getConnection(DBURL, DBUser, DBPass);

    } catch (SQLException e) {

    e.printStackTrace();

    }

    return con;

    }

    }

     

    计应192(西)

    7组

    程腾飞

  • 相关阅读:
    HDU 2045 不容易系列之(3)—— LELE的RPG难题(递归/动态规划)
    UVALive 6885 spfa
    hdu 1142 A Walk Through the Forest spfa
    hdu 2795 Billboard 线段树
    hdu 1394 Minimum Inversion Number 线段树求逆序数
    hdu 1754 I Hate It 线段树-区间最值
    poj 1088 滑雪 动态规划
    poj 1163 The Triangle 动态规划
    hdu 1258 Sum It Up 搜索
    hdu 3006 The Number of set 状态压缩
  • 原文地址:https://www.cnblogs.com/7930li/p/14632790.html
Copyright © 2011-2022 走看看