zoukankan      html  css  js  c++  java
  • C#对时间的操作

        //获取当前星期的开始日期和结束日期
        private void TimeBE(out string bDate, out string eDate)
        {
            string firstDateText = NowTime();
            DateTime firstDay = Convert.ToDateTime(firstDateText);
            double theday;
            if (firstDay.DayOfWeek == DayOfWeek.Sunday) { theday = 7; }
            else if (firstDay.DayOfWeek == DayOfWeek.Monday) { theday = 1; }
            else if (firstDay.DayOfWeek == DayOfWeek.Tuesday) { theday = 2; }
            else if (firstDay.DayOfWeek == DayOfWeek.Wednesday) { theday = 3; }
            else if (firstDay.DayOfWeek == DayOfWeek.Thursday) { theday = 4; }
            else if (firstDay.DayOfWeek == DayOfWeek.Friday) { theday = 5; }
            else { theday = 6; }
            double bday = -theday;
            double eday = 7 - theday;
            bDate = firstDay.AddDays(bday).ToString();
            eDate = firstDay.AddDays(eday).ToString();
        }
        //获取当前月份的第一天
        private DateTime GetFirstDayOfMonthTime()
        {
            return GetFirstDayOfMonth(DateTime.Now.Year, DateTime.Now.Month);
        }
        //获取当前月份的最后一天
        private DateTime GetLastDayOfMonthTime()
        {
            return GetLastDayOfMonth(DateTime.Now.Year, DateTime.Now.Month);
        }
        //获取当前日期
        private string NowTime()
        {
            return DateTime.Now.Year.ToString() + "-" + DateTime.Now.Month.ToString() + "-" + DateTime.Now.Day.ToString();
        }
        //根据年份月份获取月份的第一天
        private DateTime GetFirstDayOfMonth(int Year, int Month)
        {
            return Convert.ToDateTime(Year.ToString() + "-" + Month.ToString() + "-1");
        }
        //根据年份月份获取月份的最后一天
        private DateTime GetLastDayOfMonth(int Year, int Month)
        {
            int Days = DateTime.DaysInMonth(Year, Month);
            return Convert.ToDateTime(Year.ToString() + "-" + Month.ToString() + "-" + Days.ToString());
        }
  • 相关阅读:
    Codeforces Round #196 (Div. 1) B. Book of Evil 树形DP
    Codeforces Round #214 (Div. 2) C. Dima and Salad 背包DP
    Codeforces Round #208 (Div. 2) D. Dima and Hares DP
    CROC-MBTU 2012, Elimination Round (ACM-ICPC) H. Queries for Number of Palindromes 区间DP
    Codeforces Round #204 (Div. 1) B. Jeff and Furik 概率DP
    Codeforces Round #323 (Div. 1) B. Once Again... DP
    2017"百度之星"程序设计大赛
    数据库学习
    数据库学习
    网络传输中的两个阶段、阻塞IO、非阻塞IO和多路复用
  • 原文地址:https://www.cnblogs.com/myssh/p/1530752.html
Copyright © 2011-2022 走看看