Returns the maximum number of interconnected sub-arrays of a two-dimensional integer array

Title: Returns the number of the largest interconnected subarray in a two-dimensional integer array.

Requirements: Enter a two-dimensional shape array with positive and negative numbers in the array. The maximum value for the and of all sub-arrays.

First, design ideas

First find the maximum value in this array, and locate, and then figure out the value around the 4 numbers, unicom the 4 number of positive numbers, if all negative, then find the sub-large value, and the maximum value of Unicom, to determine the pre-Unicom and Unicom is worth the size, if the smaller is not connected to the maximum value, and so on, Until the maximum Unicom sub-array How to connect is smaller than the original value.

Returns the maximum number of interconnected sub-arrays of a two-dimensional integer array