• 获得每日,每周,每月的0点和24点的时间戳


    //获得当天0点时间
    public static int getTimesmorning(){
    Calendar cal = Calendar.getInstance();
    cal.set(Calendar.HOUR_OF_DAY, 0);
    cal.set(Calendar.SECOND, 0);
    cal.set(Calendar.MINUTE, 0);
    cal.set(Calendar.MILLISECOND, 0);
    return (int) (cal.getTimeInMillis()/1000);
    }
    //获得当天24点时间
    public static int getTimesnight(){
    Calendar cal = Calendar.getInstance();
    cal.set(Calendar.HOUR_OF_DAY, 24);
    cal.set(Calendar.SECOND, 0);
    cal.set(Calendar.MINUTE, 0);
    cal.set(Calendar.MILLISECOND, 0);
    return (int) (cal.getTimeInMillis()/1000);
    }
    //获得本周一0点时间
    public static int getTimesWeekmorning(){
    Calendar cal = Calendar.getInstance();
    cal.set(cal.get(Calendar.YEAR),cal.get(Calendar.MONDAY), cal.get(Calendar.DAY_OF_MONTH), 0, 0,0);
    cal.set(Calendar.DAY_OF_WEEK, Calendar.MONDAY);
    return (int) (cal.getTimeInMillis()/1000);
    }
    //获得本周日24点时间
    public static int getTimesWeeknight(){
    Calendar cal = Calendar.getInstance();
    cal.set(cal.get(Calendar.YEAR),cal.get(Calendar.MONDAY), cal.get(Calendar.DAY_OF_MONTH), 0, 0,0);
    cal.set(Calendar.DAY_OF_WEEK, Calendar.MONDAY);
    return (int) ((cal.getTime().getTime()+ (7 * 24 * 60 * 60 * 1000))/1000);
    }
    //获得本月第一天0点时间
    public static int getTimesMonthmorning(){
    Calendar cal = Calendar.getInstance();
    cal.set(cal.get(Calendar.YEAR),cal.get(Calendar.MONDAY), cal.get(Calendar.DAY_OF_MONTH), 0, 0,0);
    cal.set(Calendar.DAY_OF_MONTH,cal.getActualMinimum(Calendar.DAY_OF_MONTH));
    return (int) (cal.getTimeInMillis()/1000);
    }
    //获得本月最后一天24点时间
    public static int getTimesMonthnight(){
    Calendar cal = Calendar.getInstance();
    cal.set(cal.get(Calendar.YEAR),cal.get(Calendar.MONDAY), cal.get(Calendar.DAY_OF_MONTH), 0, 0,0);
    cal.set(Calendar.DAY_OF_MONTH,cal.getActualMaximum(Calendar.DAY_OF_MONTH));
    cal.set(Calendar.HOUR_OF_DAY, 24);
    return (int) (cal.getTimeInMillis()/1000);
    }
  • 相关阅读:
    设计与声明
    字符串匹配算法——KMP、BM、Sunday
    红黑树——原理
    Linux命令——监视相关
    资源管理
    排序算法——QuickSort、MergeSort、HeapSort(C++实现)
    智能指针——使用与实现
    进程间通信——实现
    构造/析构/赋值运算
    物理内存管理
  • 原文地址:https://www.cnblogs.com/jzm53550629/p/3305324.html
Copyright © 2020-2023  润新知