Python code 0627

有关记忆曲线，不完整的代码
参数1：总任务量
参数2：计划完成的天数

import getopt
import sys

targetDay = [0, 1, 2, 4, 7, 15]

def showAction(actions):
    for i in range(len(actions)):
        print("\nDay %d : " % (i+1)),
        for j in range(len(actions[i])):
            print(actions[i][j]),

def help():
    print("help()...")

def appendDay(day):
    curAction = []
    for i in targetDay[::-1]:
        if day > i:
            curAction.append(day-i)
    return curAction

def main(argv):
    try:
        opts, args = getopt.getopt(argv, "h", ["help",])
    except:
        print "getopt error!"
        sys.exit(2)

    for name, value in opts:
        if name in ('-h', '--help'):
            help()

    if len(args)!=2:
        help()

    total = int(args[0])
    days = int(args[1])
    print("total = %d, days = %d" % (total, days) )

    if total < 1 or days < 1:
        help()

    numberOfDay = total/days
    plan=[numberOfDay for i in range(days) ]
    remaining = total - (numberOfDay * days)
    if remaining > 0:
        plan[-1] = plan[-1] + remaining
    print("plan: ", plan)

    action=[]
    for day,value in enumerate(plan,1):
        action.append(appendDay(day))
    showAction(action)

if __name__ == '__main__':
    main(sys.argv[1:])