Beautiful is better than ugly.Explicit is better than implicit.Simple is better than complex.Complex is better than complicated.Flat is better than nested.Sparse is better than dense.Readability counts.Special cases aren't special enough to break the
中文 简介 存在由非负整数组成的正方形矩阵n × n。你应该找到这样的一条路将所有数连起来,求积。 开始于左上方; 每个数从左边或者下边来链接下一个数; 结束于右下角。 此外,如果我们将所有数字相乘,积的结尾有最少的零。 左上角开始走,走到右下角,只能向右或向下走,将经过的数字
def delete_file_in_dir(dir): if not os.path.exists(dir): return 1 try: for i in os.listdir(dir): path_way = os.path.join(dir,i) #如果是文件就删除 if os.path.isfile(path_way): os.remove(pat