考勤管理系统：查询每个用户应该打卡的次数

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接： https://blog.csdn.net/pingsha_luoyan/article/details/98621940

能不能看懂全是缘分，改了2个小时的代码，可以优化。（优化内容：法定假日我没考虑）

这段代码实现了无论你给出两个相差多少的数据，都会统计出该用户需要的打卡次数。

# encoding:utf-8
import csv
import config
import pandas
from datetime import datetime
# 将用户名去重,得到所有的用户列表
def get_username():
    csv_info= pandas.read_csv(config.url,usecols=[1])
    csv_list=csv_info["姓名"]
    csv_list=list(csv_list)
    csv_set=set(csv_list)
    user_list=list(csv_set)
    user_new_list=[]
    first_time=0
    last_time=0
    days=0
    week=1
    for user in user_list:
        user_new_list.append([user,first_time,last_time,0,days,week])
    # print(user_new_list)
    return user_new_list
# 获得所有的用户名和用户时间
def get_userNameAndTime():
    reader = list(csv.reader(open(config.url, encoding='utf-8')))
    list_nameAndTime=[]
    i = 0
    for re in reader:
        if i==0:
            i=1
            continue
        list_nameAndTime.append([re[0],re[1]])
    return list_nameAndTime
def need_03(user_list,list_time):
    for i in range(len(list_time)):
        for j in range(len(user_list)):
            if list_time[i][1]==user_list[j][0] and user_list[j][3]==0:
                user_list[j][1]=list_time[i][0]
                user_list[j][3]=1
            if list_time[i][1]==user_list[j][0]:
                user_list[j][2] = list_time[i][0]
    return user_list
def get_need_03(list_time_new):
    for i in range(len(list_time_new)):
        date_first=datetime.strptime(list_time_new[i][1],"%Y/%m/%d")
        date_last=datetime.strptime(list_time_new[i][2],"%Y/%m/%d")
        days=date_last-date_first
        day=days.days
        list_time_new[i][3]+=day
        week = datetime.strptime(list_time_new[i][1], "%Y/%m/%d").weekday()
        # print(type(week))
        list_time_new[i][5]+=week
        # print(len(list_time_new))
        # print(type(list_time_new[i][4]))
    return list_time_new
def by_days_week_get_count(list):
    for i in range(len(list)):
        days=list[i][3]
        x=days//7
        list[i][4]=x*6
        y=days%7
        if y!=0:
            temp=y+list[i][5]
            if temp>=7:
                list[i][4]=list[i][4]+y-1
            else:
                list[i][4]=list[i][4]+y
    return list