leetcode 43: 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.


uncompleted


class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        if( matrix.size() == 0 ) return;
        
        size_t row = matrix.size();
        size_t col = matrix[0].size();
        
        bool row_flag = false, col_flag = false;
        
        for( int i=0; i<row; i++) {
            if( matrix[i][0] == 0 ) {
                row_flag = true;
            }
        }
        
        
        for( int j=0; j<col; j++) {
            if( matrix[0][j] == 0 ) {
                col_flag = true;
            }
        }
        
        
        for( int i=1; i< row; i++) {
            for ( int j=1; j< col; j++) {
                if( matrix[i][j] == 0 ) {
                    matrix[0][j] = 0;
                    matrix[i][0] = 0;
                }
            }
        }
        
        for( int i=0; i<matrix.size(); i++) {
            if(matrix[i][0] == 0) {
                for( int j=1; j<matrix[0].size(); j++){
                    matrix[i][j] = 0;
                }
            } else if(row_flag) {
                matrix[i][0] = 0;
            }
        }
        
        for( int j=0; j<matrix[0].size(); j++) {
            if(matrix[0][j] == 0) {
                for( int i=1; i<matrix.size(); i++){
                    matrix[i][j] = 0;
                }
            } else if(col_flag) {
                matrix[0][j] = 0;
            }
        }
    }
};


java version passed.

public class Solution {
    public void setZeroes(int[][] matrix) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(matrix==null || matrix[0]==null ) return;
        //if(matrix.length==1) return; [[0,1]] matrix is not square not rectangle. when u modify at one place may influence many.
        int m = matrix.length;
        int n  = matrix[0].length;
        
        boolean firstRow = false;
        boolean firstCol = false;
    
        for(int j=0; j<n; j++) {
            if(matrix[0][j]==0) {
                firstRow = true;
                break;
            }
        }
        
        for(int i=0; i<m; i++) {
            if(matrix[i][0]==0) {
                firstCol = 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++) {
            for(int j=1; j<n; j++) {
                if(matrix[0][j]==0 || matrix[i][0]==0) {
                    matrix[i][j]=0;
                }
            }
        }
        
        if(firstRow) {
            for(int j=0; j<n;j++) {
                matrix[0][j] = 0;
            }
        }
        
        if(firstCol) {
            for(int i=0; i<m; i++) {
                matrix[i][0] = 0;
            }
        }
    }
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值