java时间比较2

最新推荐文章于 2022-11-07 18:58:31 发布

BerLinFly

最新推荐文章于 2022-11-07 18:58:31 发布

阅读量269

点赞数

本文链接：https://blog.csdn.net/BerLinFly/article/details/51707304

版权

             long t=-1;
                      long t2=-1;
                      //long days = 0;
                      s=res.getString(9);

                   /* try {

                       Date date1 = new SimpleDateFormat("yyyy-mm-dd").parse(s1);
                         Date date2 = new SimpleDateFormat("yyyy-mm-dd").parse(s2);
                         Date date3 = new SimpleDateFormat("yyyy-mm-dd").parse(s);
                         t=(date3.getTime()-date1.getTime())/86400000;
                         t2=(date2.getTime()-date3.getTime())/86400000;
                       System.out.println(t);
                       System.out.println(t2);

                            }
                            catch (ParseException e) {
                                   e.printStackTrace();
                                  } */

//System.out.println(days);

//开始

                      DateFormat df = new SimpleDateFormat("yyyy-MM-dd");
                        try {
                            Date dt1 = df.parse(s1);
                            Date dt2 = df.parse(s2);
                            Date dt= df.parse(s);
                            if (dt1.getTime() <dt.getTime()) {
                                //System.out.println("dt1 在dt2前");
                                System.out.println((dt2.getTime()-dt1.getTime())/86400000);
                                t=(dt.getTime()-dt1.getTime())/86400000;

                            }
                            if (dt2.getTime() >dt.getTime()) {
                                //System.out.println("dt1在dt2后");
                                System.out.println((dt2.getTime()-dt.getTime())/86400000);
                                t2=(dt2.getTime()-dt.getTime())/86400000;
                            }


                        } catch (Exception exception) {
                            exception.printStackTrace();
                        }
                      if(t>=0&&t2>=0)