Python实现Windows风格文件夹自然排序的全攻略

import os
import re
from pathlib import Path

def natural_sort_key(name):
    """生成自然排序键：数字部分转整数，非数字部分小写"""
    # 正则表达式捕获所有连续数字序列
    parts = re.split(r'(\d+)', name)
    # 转换数字部分为整数，非数字部分统一小写
    return [int(part) if part.isdigit() else part.lower() for part in parts]

# 获取当前目录所有文件夹
directory = "."
folders = [f for f in os.listdir(directory) if Path(f).is_dir()]

# 执行自然排序
sorted_folders = sorted(folders, key=natural_sort_key)

# 输出排序结果
print("自然排序结果：")
for idx, folder in enumerate(sorted_folders, 1):
    print(f"{idx:2d}. {folder}")

def get_subfolders(root_dir):
    subfolders = []
    for entry in Path(root_dir).iterdir():
        if entry.is_dir():
            subfolders.append(entry)
    return sorted(subfolders, key=lambda x: natural_sort_key(x.name))

# 示例：获取项目目录下的子文件夹
project_dir = "data/projects"
sorted_subfolders = get_subfolders(project_dir)

# 先按文件类型排序，再按自然顺序
sorted_files = sorted(entries, 
                    key=lambda x: (x.suffix.lower(), natural_sort_key(x.stem)))

test_folders = ['1', '2', '10', '11', '11-1', '11-2', '123', 'folderA', 'folder2', 'folder10']

1. 1
2. 2
3. 10
4. 11
5. 11-1
6. 11-2
7. 123
8. folder2
9. folderA
10. folder10