Description: Suppose there are two elements of value by increasing order of linear tables A and B, are stored in the form of a single list, which corresponds to most of the elements are equal, delete some elements (A and B, there is no, or B in which a no), so that the retained element is equal to the corresponding two ordered tables. After such, A middle element (1,3,5,7,8,10,13,18), B the elements (1,3,6,8,9,10,13,15), then remove elements a, B, the elements of (1,3,8,10,13).
To Search:
File list (Check if you may need any files):
111320208陈奕杰个人实验1之猴子选大王.cpp
Download