LeetCode--73--medium--SetMatrixZeroes

summary:

hash table

package myapp.kit.leetcode.top145;

import java.util.HashSet;
import java.util.Set;

/**
 *
 * 73
 * medium
 * https://leetcode.com/problems/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?
 *
 * @author huangdingsheng
 * @version 1.0, 2020/6/11
 */
public class SetMatrixZeroes {

    public void setZeroes(int[][] matrix) {
        Set<Integer> x = new HashSet<>();
        Set<Integer> y = new HashSet<>();
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[i].length; j++) {
                if (matrix[i][j] == 0) {
                    x.add(i);
                    y.add(j);
                }
            }
        }
        for (int i : x) {
            for (int j = 0; j < matrix[i].length; j++) {
                matrix[i][j] = 0;
            }
        }
        for (int j : y) {
            for (int i = 0; i < matrix.length; i++) {
                matrix[i][j] = 0;
            }
        }
    }

//    public void setZeroes2(int[][] matrix) {
//        boolean fr = false,fc = false;
//        for(int i = 0; i < matrix.length; i++) {
//            for(int j = 0; j < matrix[0].length; j++) {
//                if(matrix[i][j] == 0) {
//                    if(i == 0) fr = true;
//                    if(j == 0) fc = true;
//                    matrix[0][j] = 0;
//                    matrix[i][0] = 0;
//                }
//            }
//        }
//        for(int i = 1; i < matrix.length; i++) {
//            for(int j = 1; j < matrix[0].length; j++) {
//                if(matrix[i][0] == 0 || matrix[0][j] == 0) {
//                    matrix[i][j] = 0;
//                }
//            }
//        }
//        if(fr) {
//            for(int j = 0; j < matrix[0].length; j++) {
//                matrix[0][j] = 0;
//            }
//        }
//        if(fc) {
//            for(int i = 0; i < matrix.length; i++) {
//                matrix[i][0] = 0;
//            }
//        }
//
//    }
}