The first attempt to solve the 'Surrounded Regions' problem in leetcode with O(n^2) time/space solution. This algorithm is too slow to pass the large data set in leetcode online judge because it needs to traverse the O(n^2) board twice.