对包含X、Y和Z字符的字符串进行排序的最小交换次数

def min_swaps(string):
    x_count = 0
    y_count = 0
    z_count = 0

    # 统计X、Y和Z字符的个数
    for char in string:
        if char == 'X':
            x_count += 1
        elif char == 'Y':
            y_count += 1
        elif char == 'Z':
            z_count += 1

    # 构建排序后的目标字符串
    target_string = 'X' * x_count + 'Y' * y_count + 'Z' * z_count

    # 使用双指针法进行交换
    swaps = 0
    left = 0
    right = len(string) - 1

    while left < right:
        if string[left] != target_string[left]:
            while string[right] != target_string[left]:
                right -= 1
            # 交换字符
            string[left], string[right] = string[right], string[left]
            swaps += 1

        left += 1

    return swaps

# 测试示例
string = "ZYXZYX"
min_swaps(string)