例2：合并排序数组

#输入123返回321输入900返回9
from IPython import embed
import time

class Solution(object):
	def mergesort_Array(self, A = None, B = None):
		C = A + B
		return sorted(C)
	def f(self, A = None, B = None):
		C = []
		i, j = 0, 0
		while i < len(A) and j < len(B):
			if A[i] < B[j]:
				C.append(A[i])
				i += 1
			else:
				C.append(B[j])
				i += 1
		while i < (len(A)):
			C.append(i)
			i += 1
		while j < (len(B)):
			C.append(j)
			j += 1
		return C



if __name__ == '__main__':
	solution = Solution()
	import random
	import time

	a = list(range(0, 5000))
	b = list(range(5000, 10000))
	#print("a:", a)
	#print("b:", b)
	star = time.clock()
	print("merge ab sorted:",solution.mergesort_Array(a, b))
	end = time.clock()
	print("cost time:",end - star)

	star = time.clock()
	print("merge ab sorted:", solution.f(a, b))
	end = time.clock()
	print("cost time:", end - star)