def _is_permutation_winning(my, result, count):
    """判断是否匹配(排列方式)
    my: 排列数1
    result: 排列数2
    count: 匹配的位数
    e.g.:
        my     = [9,9,8,5,6,3,8]
        result = [2,0,3,5,6,4,9]
        count  = 2
        return is True
    """
    s, e = 0, count #逐个切片
    while e <= len(result):
        if my[s:e] == result[s:e]:
            return True
        s += 1
        e += 1
    return False