Careercup

2014-05-02 00:22

题目链接

原题：

Given a matrix consisting of 0's and 1's, find the largest connected component consisting of 1's.

题目：给定一个01矩阵，找出由1构成的连通分量中最大的一个。

解法：四邻接还是八邻接也不说，我就当四邻接了。这种Flood Fill问题，可以用BFS或者DFS解决。

代码：

// http://www.careercup.com/question?id=5998719358992384
#include <vector>
using namespace std;

class Solution {
public:
    int maxConnectedComponent(vector<vector<int> > &v) {
        n = (int)v.size();
        if (n == 0) {
            return 0;
        }
        m = (int)v[0].size();
        if (m == 0) {
            return 0;
        }
        
        int res, max_res;
        
        max_res = 0;
        for (i = 0; i < n; ++i) {
            for (j = 0; j < m; ++j) {
                if (!v[i][j]) {
                    continue;
                }
                res = 0;
                
                v[i][j] = 0;
                ++res;
                DFS(v, i, j, res);
                max_res = res > max_res ? res : max_res;
            }
        }
        
        return max_res;
    };
private:
    int n, m;
    
    void DFS(vector<vector<int> > &v, int i, int j, int &res) {
        static const int d[4][2] = {
            {-1,  0}, 
            { 0, -1}, 
            {+1,  0}, 
            { 0, +1}
        };
        
        int k, x, y;
        for (k = 0; k < 4; ++k) {
            x = i + d[k][0];
            y = j + d[k][1];
            if (x < 0 || x > n - 1 || y < 0 || y > m - 1) {
                continue;
            }
            if (!v[x][y]) {
                continue;
            }
            v[x][y] = 0;
            ++res;
            DFS(v, x, y, res);
        }
    };
};