LeetCode in Java [8]: 73. 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.

Example 1:

Input: 
[
  [1,1,1],
  [1,0,1],
  [1,1,1]
]
Output: 
[
  [1,0,1],
  [0,0,0],
  [1,0,1]
]

Example 2:

Input: 
[
  [0,1,2,0],
  [3,4,5,2],
  [1,3,1,5]
]
Output: 
[
  [0,0,0,0],
  [0,4,5,0],
  [0,3,1,0]
]

Follow up:

• 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)空间复杂度的方法：

Success

Runtime: 1 ms, faster than 100.00% of Java online submissions for Set Matrix Zeroes.

Memory Usage: 48.9 MB, less than 34.28% of Java online submissions for Set Matrix Zeroes.

class Solution {
    public void setZeroes(int[][] matrix) {
        int l=matrix.length;
        int h=matrix[0].length;
        boolean[] zerocol=new boolean[l];
        boolean[] zerorow=new boolean[h];
        for(int i=0;i<l;i++){
            for(int j=0;j<h;j++){
                if(matrix[i][j]==0){
                    zerocol[i]=true;
                    zerorow[j]=true;
                }
            }
        }
        for(int i=0;i<l;i++){
            if(zerocol[i]==true){
                for(int j=0;j<h;j++){matrix[i][j]=0;}
            }
        }
        for(int j=0;j<h;j++){
            if(zerorow[j]==true){
                for(int i=0;i<l;i++){matrix[i][j]=0;}
            }
        }
    }
}

O(1)额外空间：

Success

Runtime: 1 ms, faster than 100.00% of Java online submissions for Set Matrix Zeroes.

Memory Usage: 48.4 MB, less than 41.43% of Java online submissions for Set Matrix Zeroes.

class Solution {
    public void setZeroes(int[][] matrix) {
        int l=matrix.length;
        int h=matrix[0].length;
        boolean fciszero=false;
        for(int i=0;i<l;i++){
            if(matrix[i][0]==0){fciszero=true;}
            for(int j=1;j<h;j++){
                if(matrix[i][j]==0){
                    matrix[0][j]=0;
                    matrix[i][0]=0;
                }
            }
        }
        for(int i=1;i<l;i++){
            for(int j=1;j<h;j++){
                if(matrix[0][j]==0||matrix[i][0]==0){
                    matrix[i][j]=0;
                }
            }
        }
        if(matrix[0][0]==0){
            for(int j=0;j<h;j++){
                matrix[0][j]=0;
            }
        }
        if(fciszero){
            for(int i=0;i<l;i++){
                matrix[i][0]=0;
            }
        }
        
    }
}