说明：  请设计一个算法来完成两个超长正整数的加法。 *问题分析与算法设计 首先要设计一种数据结构来表示一个超长的正整数，然后才 能够设计算法。 首先我们采用一个带有表头结点的环形链来表示一个非负的 超大整数，如果从低位开始为每 个数字编号，则第一位到第四 位、第五位到第八位...的每四位组成的数字，依次放在链表的 第一个、第二个、...结点中，不足4位的最高位存放在链表的最 后一个结点中，表头结点的值规定为-1。
(requested to design a lgorithm to complete two long integer is the additive.* Analysis and design of the first algorithm to design a data structure to indicate a supernatural being rounded up before they can be designed algorithm. First, we used a table with the first node of the said circular chain to a large non-negative integers, starting from the low figures for each, the first one place to fourth, fifth to eighth places ... each consisting of four figures, followed on the List of the first, second,. .. node, less than the maximum four-stored in a linked list of nodes Finally, the table first node provides for the value-1.)