是否有任何python代码或对Gale Shapley算法的修改，以便它可以解决不完整偏好列表的稳定婚姻问题

def stable_marriage(preference_men, preference_women):
    n = len(preference_men)
    engaged_men = [None] * n
    engaged_women = [None] * n
    men_preferences = [0] * n

    while None in engaged_men:
        for man in range(n):
            if engaged_men[man] is None:
                woman = preference_men[man][men_preferences[man]]
                men_preferences[man] += 1

                if engaged_women[woman] is None:
                    engaged_men[man] = woman
                    engaged_women[woman] = man
                else:
                    current_man = engaged_women[woman]
                    if preference_women[woman].index(man) < preference_women[woman].index(current_man):
                        engaged_men[current_man] = None
                        engaged_men[man] = woman
                        engaged_women[woman] = man

    return engaged_men

# 示例使用
preference_men = [[1, 0], [0, 1]]
preference_women = [[0, 1], [1, 0]]
result = stable_marriage(preference_men, preference_women)
print(result)