892——2021——7日期查找

求一些不确定个数的日期距离今天最近的三个日期输出

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int month[13][2] = {
        {0,0}, {31,31}, {28, 29}, {31, 31}, {30, 30}, {31, 31},
        {30, 30}, {31, 31}, {31, 31}, {30, 30}, {31, 31}, {30, 30},
        {31, 31}
};
typedef struct LNode {
    int date;
    int data;
    int length;
    struct LNode* next;
}LNode, *LinkList;
//尾插法创建单链表
LinkList List_TailInsert(LinkList& L) {
    int x;
    L = new LNode();
    LNode *s, *r = L; //r为表尾指针；
    L->length = 0;
    int count = 0; //计数变量；
    cin>>x;
    while(x != 9999) {
        s = (LNode*) malloc(sizeof(LNode));
        s->date = x;
        r->next = s;
        r = s;
        scanf("%d", &x);
        count++;
    }
    L->length = count;
    r->next = NULL;
    return L;
}
//对单链表进行快速排序
void quick_sort_list(LNode* start, LNode* end=NULL)
{
    if (start == NULL || start == end) return;

    LNode* p1 = start;
    LNode* p2 = start->next;

    while (p2 != end) {
        if (p2->data < start->data) {
            p1 = p1->next;
            swap(p1->data, p2->data);
        }
        p2 = p2->next;
    }
    swap(p1->data, start->data);

    quick_sort_list(start, p1);
    quick_sort_list(p1->next, end);
}
//判断是否为闰年
bool isLeap(int year) {
    if(year%4==0 && year%100!=0 || year%400==0)
        return true;
    else
        return false;
}
//求两个日期的差值
int gapDate(int time1, int time2) {
    int y1, m1, d1, y2, m2, d2;
    int date1 = time1, date2 = time2;
    if(date1 > date2)               //第一个日期如果晚于第二个日期则交换
        swap(date1, date2);
    y1 = date1 / 10000, m1 = date1 % 10000 / 100, d1 = date1 % 100;
    y2 = date2 / 10000, m2 = date2 % 10000 / 100, d2 = date2 % 100;
    int ans = 1;                //记录结果；
    //第一个日期没有达到第二个日期时进行循环；
    //即：!（y1==y2） && (m1==m2) && (d1==d2)
    while(y1<y2 || m1<m2 || d1<d2) {
        d1++;
        if(d1 == month[m1][isLeap(y1)] + 1) {
            m1++;
            d1 = 1;
        }
        if(m1 == 13) {
            y1++;
            m1 = 1;
        }
        ans++;
    }
    return ans;
}
void Reverse(LinkList& L)
{
    LNode *p, *r;
    p=L->next;
    L->next=NULL;
    while(p)
    {
        r=p->next;
        p->next=L->next;
        L->next=p;
        p=r;
    }
}
int main() {
    LinkList L = NULL;
    List_TailInsert(L);
    LNode* p = L->next;
    while(p!=NULL) {
        p->data = gapDate(20221123, p->date);
        p = p->next;
    }

    quick_sort_list(L);
    Reverse(L);
    p = L->next;
    for(int i=0; i<3; i++) {
        cout<<p->date<<" ,"<<p->data<<"  ;";
        p = p->next;
    }
    cout<<endl;

    return 0;
}