二分策略递归算法：

def schedule(n): if n == 1: return [[0]] else: sub_schedule = schedule(n//2) schedule_table = [[0 for i in range(n-1)] for j in range(n)] for i in range(n): for j in range(n//2): schedule_table[i][j] = sub_schedule[i][j] schedule_table[i][j+(n//2)] = (sub_schedule[i][j]+(n//2)) % (n-1) schedule_table[i][(n-2)-j] = (sub_schedule[i][(j+(n//2)-1) % (n-1)]+(n//2)) % (n-1) schedule_table[i][n-2] = n-1 return schedule_table

测试

n = 8 schedule_table = schedule(n) print("比赛日程表：") for i in range(n): print(schedule_table[i])

输出： 比赛日程表： [0, 1, 2, 3, 4, 5, 6] [1, 0, 3, 2, 5, 4, 7] [2, 3, 0, 1, 6, 7, 4] [3, 2, 1, 0, 7, 6, 5] [4, 5, 6, 7, 0, 1, 2] [5, 4, 7, 6, 1, 0, 3] [6, 7, 4, 5, 2, 3, 0] [7, 6, 5, 4, 3, 2, 1]

二分策略非递归算法：

def schedule(n): if n == 1: return [[0]] else: schedule_table = [[0 for i in range(n-1)] for j in range(n)] sub_n = 1 while sub_n < n: for i in range(sub_n): for j in range(sub_n//2): for k in range(sub_n//2): schedule_table[i+jsub_n2+k][sub_n-1] = i+ksub_n2+jsub_n schedule_table[i+ksub_n2+jsub_n][sub_n-1] = i+jsub_n2+k*sub_n sub_n *= 2 return schedule_table

测试

n = 8 schedule_table = schedule(n) print("比赛日程表：") for i in range(n): print(schedule_table[i])

输出： 比赛日程表： [0, 1, 2, 3, 4, 5, 6] [1, 0, 3, 2, 5, 4, 7] [2, 3, 0, 1, 6, 7, 4] [3, 2, 1, 0, 7, 6, 5] [4, 5, 6, 7, 0, 1, 2] [5, 4, 7, 6, 1, 0, 3] [6, 7, 4, 5, 2, 3, 0] [7, 6, 5, 4, 3, 2, 1]

利用数据间的规律构造算法：

def schedule(n): if n == 1: return [[0]] else: schedule_table = [[0 for i in range(n-1)] for j in range(n)] for i in range(n): for j in range(n-1): schedule_table[i][j] = (i+j) % (n-1) if i+j >= n-1: schedule_table[i][j] += 1 return schedule_table

测试

n = 8 schedule_table = schedule(n) print("比赛日程表：") for i in range(n): print(schedule_table[i])

输出： 比赛日程表： [0, 1, 2, 3, 4, 5, 6] [1, 0, 3, 2, 5, 4, 7] [2, 3, 0, 1, 6, 7, 4] [3, 2, 1, 0, 7, 6, 5] [4, 5, 6, 7, 0, 1, 2] [5, 4, 7, 6, 1, 0, 3] [6, 7, 4, 5, 2, 3, 0] [7, 6, 5, 4, 3, 2, 1]

二维递推算法：

def schedule(n): schedule_table = [[0 for i in range(n-1)] for j in range(n)] for i in range(n): schedule_table[i][0] = i for j in range(1, n-1): if j % 2 == 1: for i in range(n): schedule_table[i][j] = schedule_table[i][(j-1)//2] else: for i in range(n): schedule_table[i][j] = (schedule_table[i][j-1]+(n//2)) % (n-1) if schedule_table[i][j] >= i: schedule_table[i][j] += 1 return schedule_table

测试

n = 8 schedule_table = schedule(n) print("比赛日程表：") for i in range(n): print(schedule_table[i])

输出： 比赛日程表： [0, 1, 2, 3, 4, 5, 6] [1, 0, 3, 2, 5, 4, 7] [2, 3, 0, 1, 6, 7, 4] [3, 2, 1, 0, 7, 6, 5] [4, 5, 6, 7, 0, 1, 2] [5, 4, 7, 6, 1, 0, 3] [6, 7, 4, 5, 2, 3, 0] [7, 6, 5, 4, 3, 2, 1