class Solution:
#参数A:有序整数数组A
#参数B:有序整数数组B
#返回:一个新的有序整数数组
def mergeSortedArray(self,A,B): #此方法不适合无序数组的合并排序,只适合有序数组
i,j = 0,0
C = []
while i<len(A) and j<len(B):
if A[i]<B[j]:
C.append(A[i])
i+=1
else:
C.append(B[j])
j+=1
while i<len(A): #用来处理超过A或B数组的长度
C.append(A[i])
i+=1
while j<len(B):
C.append(B[j])
j+=1
return C
#主函数
if __name__ == '__main__' :
# A = [1,4]
# B = [1,2,3]
# D = [1,2,3,4]
# E = [2,4,5,6]
# solution = Solution()
# solution1=solution.mergeSortedArray(A,B)
# solution2 = solution.mergeSortedArray(D,E)
# print("输入:",A," ",B)
# print("输出:",solution1)
# print("输入:", D, " ", E)
# print("输出:", solution2)
A = input("输入A:").split(",")
B = input("输入B:").split(",")
solution = Solution()
print("输出:",solution.mergeSortedArray(A,B))
C = []
for i in range (len(A)):
C.append(A[i])
for j in range (len(B)):
C.append(B[j])
C.sort(reverse=False)
print("C.sort(reverse=False):",C)
C.sort(reverse=True)
print("C.sort(reverse=True)",C)