Seeking a broad depth of the table The use of an array passed by value, establish a single list of its initialization. Recursive find the depth of each sub-table, and then find the generalized table depth. Depth look at two tables are the same, if the same as in Table A, each element i, scan the table B, each element with the i elements of the same depth of j, then i each element j in each element were compared. (Using a recursive algorithm) 搜索

generallist.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．