（有序表（顺序储存）合并）假设有两个有序表LA和LB，设计一个算法，将他们合并成一个有序表LC（假设每个有序表中和两个有序表间均不存在重复元素）。要求不破坏原有表LA和LB。((ordered table (sequential storage) merger) assuming a two ordered list of LA and LB, to design an algorithm to merge them into an orderly table LC (assuming each ordered table and two ordered lists all duplicate elements). Requirements do not destroy the original tables LA and LB.)