C++获取下一天和上一天

根据今天的日期获取下一天的日期，输入日期格式是20190520 的字符串

方便自己和别人使用

int is_leap_year(int year)
{
    return year % 400 == 0 || (year % 4 == 0 && year % 100 != 0);
}
std::string get_next_day(const std::string& cur_day)
{
    if (cur_day.size() < 8) {
        return std::string("");
    }
    int year = 0, month = 0, day = 0;
    try {
        year = std::stoi(cur_day.substr(0, 4));
        month = std::stoi(cur_day.substr(4, 2));
        day = std::stoi(cur_day.substr(6, 2));
    }
    catch (std::invalid_argument) {
        return std::string("");
    }
    if (12 == month) {
        if (31 == day) {
            year += 1; month = 1; day = 1;
        }
        else if (day < 31) {
            day += 1;
        }
        else {
            return std::string("");
        }
        char buf[64] = {0};
        std::snprintf(buf, sizeof(buf), "%04d%02d%02d", year, month, day);
        return std::string(buf);
    }
    bool is_leap = is_leap_year(year);
    ///< 处理2月
    if (2 == month) {
        if (is_leap) {
            if (29 == day) {
                day = 1;
                month = 3;
            }
            else if (day < 29) {
                day += 1;
            }
            else {
                return std::string("");
            }
        }
        else {
            if (28 == day) {
                day = 1;
                month = 3;
            }
            else if (day < 28) {
                day += 1;
            }
            else {
                return std::string("");
            }
        }
        char buf[64] = {0};
        std::snprintf(buf, sizeof(buf), "%04d%02d%02d", year, month, day);
        return std::string(buf);
    }
    switch (month) {
        case 1:
        case 3:
        case 5:
        case 7:
        case 8:
        case 10:
        {
            if (31 == day) {
                month += 1;
                day = 1;
            }
            else if (day < 31) {
                day += 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        case 4:
        case 6:
        case 9:
        case 11:
        {
            if (30 == day) {
                month += 1;
                day = 1;
            }
            else if (day < 30) {
                day += 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        default:
        {
            return std::string("");
        }
        break;
    }
    char buf[64] = {0};
    std::snprintf(buf, sizeof(buf), "%04d%02d%02d", year, month, day);
    return std::string(buf);
}

下边是获取上一天的代码

std::string get_last_day(const std::string& cur_day)
{
    if (cur_day.size() < 8) {
        return std::string("");
    }
    int year = 0, month = 0, day = 0;
    try {
        year = std::stoi(cur_day.substr(0, 4));
        month = std::stoi(cur_day.substr(4, 2));
        day = std::stoi(cur_day.substr(6, 2));
    }
    catch (std::invalid_argument) {
        return std::string("");
    }
    int limit_day = is_leap_year(year) ? 29 : 28;
    switch (month) {
        case 1:
        {
            if (1 == day) {
                year -= 1; month = 12; day = 31;
            }
            else if (day <= 31) {
                day -= 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        case 3:
        {
            if (1 == day) {
                month = 2; day = limit_day;
            }
            else if (day <= 31) {
                day -= 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        case 12:
        case 10:
        case 7:
        case 5:
        {
            if (1 == day) {
                day = 30; month -= 1;
            }
            else if (day <= 31) {
                day -= 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        case 8:
        {
            if (1 == day) {
                day = 31; month = 7;
            }
            else if (day <= 31) {
                day -= 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        case 2:
        {
            if (1 == day) {
                day = 31; month = 1;
            }
            else if (day <= limit_day) {
                day -= 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        case 4:
        case 6:
        case 9:
        case 11:
        {
            if (1 == day) {
                day = 31; month -= 1;
            }
            else if (day <= 30) {
                day -= 1;
            }
            else {
                return std::string("");
            }
        }
        break;
        default:
        {
            return std::string("");
        }
        break;
    }
    char buf[64] = {0};
    std::snprintf(buf, sizeof(buf), "%04d%02d%02d", year, month, day);
    return std::string(buf);
}

简化一下写法，上边的有不少重复代码

std::string get_next_day_op(const std::string& cur_day)
{
    if (cur_day.size() < 8) {
        return std::string("");
    }
    int year = 0, month = 0, day = 0;
    try {
        year = std::stoi(cur_day.substr(0, 4));
        month = std::stoi(cur_day.substr(4, 2));
        day = std::stoi(cur_day.substr(6, 2));
    }
    catch (std::invalid_argument) {
        return std::string("");
    }
    int year_addend = 0, day_limit = 0;
    switch (month) {
        case 12:
        {
            year_addend = 1; day_limit = 31;
        }
        break;
        case 1:
        case 3:
        case 5:
        case 7:
        case 8:
        case 10:
        {
            year_addend = 0; day_limit = 31;
        }
        break;
        case 4:
        case 6:
        case 9:
        case 11:
        {
            year_addend = 0; day_limit = 30;
        }
        break;
        case 2:
        {
            year_addend = 0;
            day_limit = is_leap_year(year) ? 29 : 28;
        }
        break;
        default:
        {
            return std::string("");
        }
        break;
    }

    if (day_limit == day) {
        year += year_addend;
        month += 1;
        if (13 == month) {
            month = 1;
        }
        day = 1;
    }
    else if (day < day_limit) {
        day += 1;
    }
    else {
        return std::string("");
    }
    char buf[64] = {0};
    std::snprintf(buf, sizeof(buf), "%04d%02d%02d", year, month, day);
    return std::string(buf);
}

当然还可以用时间戳转换的方式来进行，这样就不存在针对不同月份和闰年的处理了，不过效率会低一些，注意这个函数没有处理输入月份和输入天数异常的情况，比如输入天数超过31天之类的问题

const uint32_t ONE_DAY_SECS = 24 * 60 * 60;
std::string get_next_day_by_timestamp(const std::string& cur_day)
{
    if (cur_day.size() < 8) {
        return std::string("");
    }
    int year = 0, month = 0, day = 0;
    try {
        year = std::stoi(cur_day.substr(0, 4));
        month = std::stoi(cur_day.substr(4, 2));
        day = std::stoi(cur_day.substr(6, 2));
    }
    catch (std::invalid_argument) {
        return std::string("");
    }
    struct tm t;
    t.tm_year = year - 1900;
    t.tm_mon = month - 1;
    t.tm_mday = day;
    t.tm_hour = 1; t.tm_min = 0; t.tm_sec = 0;
    uint64_t next_day_timestamp = std::mktime(&t) + ONE_DAY_SECS;
    struct tm time_info = *std::localtime((std::time_t*)&next_day_timestamp);
    char buf[64] = {0};
    std::strftime(buf, sizeof(buf), "%Y%m%d", &time_info);
    return std::string(buf);
}