算法——序列组合排序

列表x1和x2都已从小到大排序，与之相对应的分别是y1和y2，y1和y2没有排序。现要求把x1和x2组合成一个列表xs，y1和y2组合成一个列表ys，并且要求xs必须从小到大排序，ys必须与xs同步变化。
1、不使用sorted函数

def compare(x1, y1, x2, y2, i, j):
	global xs, ys, itop, jtop
	if x1[i] < x2[j]:
		xs.append(x1[i])
		ys.append(y1[i])
		i += 1
		if i == itop:
			xs += x2[j:]
			ys += y2[j:]
			return
		compare(x1, y1, x2, y2, i, j)
	else:
		xs.append(x2[j])
		ys.append(y2[j])
		j += 1
		if j == jtop:
			xs += x1[i:]
			ys += y1[i:]
			return
		compare(x1, y1, x2, y2, i, j)

def get_xs_ys(x1, y1, x2, y2):
	global xs, ys, itop, jtop
	xs = []
	ys = []

	itop = len(x1)
	jtop = len(x2)

	compare(x1, y1, x2, y2, 0, 0)

	return xs, ys

if __name__ == '__main__':
	x1=[1,3,6,9]
	y1=[23,15,26,78]

	x2=[2,5,8]
	y2=[54,17,26]

	xs, ys = get_xs_ys(x1, y1, x2, y2)
	print(xs, ys)

运行结果：

2、使用sorted函数

x1=[1,3,6,9]
y1=[23,15,26,78]

x2=[2,5,8]
y2=[54,17,26]

ps = []
for x, y in zip(x1 + x2, y1 + y2):
	ps.append([x,y])
ps = sorted(ps, key=(lambda x:x[0]))

xs = []
ys = []
for p in ps:
	xs.append(p[0])
	ys.append(p[1])
print(xs, ys)