Python学习之目录递归

# import os
# def computedDirSize(url = ''):
#     n = 0
#     if not os.path.exists(url):
#         return '文件不存在'
#     for i in os.listdir(url):
#         if os.path.isfile(os.path.join(url,i)):
#             n += os.path.getsize(os.path.join(url,i))
#         else:
#             n += computedDirSize(os.path.join(url,i))
#     return n

# res = computedDirSize('/Users/zhangyutong/Downloads/第一期python基础/')
# print(res)

# 目录树
import os
def dirtree(url, nbsp = ''):
    count = 0
    sizecount = 0
    for i in os.listdir(url):
        if os.path.isfile(os.path.join(url, i)):
            count += 1
            sizecount += os.path.getsize(os.path.join(url, i))
            print('%s[文件]%s --[大小:%d字节]' % (nbsp, i, os.path.getsize(os.path.join(url, i))))
        elif os.path.isdir(os.path.join(url, i)):
            print('%s[目录]%s' % (nbsp, i))
            temp = dirtree(os.path.join(url, i), nbsp + '     ')
            count += temp[0]
            sizecount += temp[1]
    return [count,sizecount]

count = dirtree('/Users/zhangyutong/Downloads/第一期python基础/')

judge = '共计文件%d个, 文件大小共%dBytes' % (count[0], count[1])
print(judge)