leetcode set-matrix-zeroes

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
click to show follow up.
Follow up:
Did you use extra space?
A straight forward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?

//空间复杂度O(m+n).
class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        int m=matrix.size(),n=matrix[0].size();
        if(m==0||n==0)
            return;
        bool flag[m+n];
        for(int i=0;i<m+n;i++)
            flag[i]=false;
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(matrix[i][j]==0){
                    flag[m+j]=true;
                    flag[i]=true;
                }
            }
        }
        for(int i=0;i<m;i++){
            if(flag[i]){
                for(int j=0;j<n;j++)
                    matrix[i][j]=0;
            }
        }
        for(int i=0;i<n;i++){
            if(flag[i+m]){
                for(int j=0;j<m;j++)
                    matrix[j][i]=0;
            }
        }
    }
};
//空间复杂度O(1)解法
思路参考这个博客的:

> http://blog.csdn.net/linhuanmars/article/details/24066199

class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        int m=matrix.size(),n=matrix[0].size();
        if(m==0||n==0)
            return;
        bool row=false,col=false;
        for(int i=0;i<m;i++){
            if(matrix[i][0]==0){
                col=true;
                break;
            }
        }
        for(int i=0;i<n;i++){
            if(matrix[0][i]==0){
                row=true;
                break;
            }
        }
        for(int i=1;i<m;i++){
            for(int j=1;j<n;j++){
                if(matrix[i][j]==0){
                    matrix[0][j]=0;
                    matrix[i][0]=0;
                }
            }
        }
        for(int i=1;i<m;i++){
            if(matrix[i][0]==0){
                for(int j=0;j<n;j++)
                    matrix[i][j]=0;
            }
        }
        for(int i=1;i<n;i++){
            if(matrix[0][i]==0){
                for(int j=0;j<m;j++)
                    matrix[j][i]=0;
            }
        }
        if(row){
            for(int i=0;i<n;i++)
                matrix[0][i]=0;
        }
        if(col){
            for(int i=0;i<m;i++)
                matrix[i][0]=0;
        }
    }
};