Python递归实现斐波那契数列和文件遍历

• 斐波那契数列

  def func(n):
      if n == 1 or n == 2:
          return 1
      else:
          return func(n-1)+func(n-2)
  func(6)     
  

• 递归遍历所有文件

  import os
  
  def show_files(path, all_files):
      file_list = os.listdir(path)
      for file in file_list:
          cur_path = os.path.join(path, file)
          if os.path.isdir(cur_path):
              # 如果是文件夹，就将当前all_files列表和路径传入
              show_files(cur_path, all_files)
          else:
              all_files.append(file)
     	return all_files
  files_list = show_files(r'', [])
  for file in files_list:
      print(file)