0
点赞
收藏
分享

微信扫一扫

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.

public class Solution {
public void setZeroes(int[][] matrix) {
if(matrix == null || matrix.length == 0)
return;

int rows = matrix.length;
int cols = matrix[0].length;

boolean empty_row0 = false;
boolean empty_col0 = false;
for(int i = 0; i < cols; i++){
if(matrix[0][i] == 0){
empty_row0 = true;
break;
}
}

for(int i = 0; i < rows; i++){
if(matrix[i][0] == 0){
empty_col0 = true;
break;
}
}

for(int i = 1; i < rows; i++) {
for(int j =1; j<cols; j++){
if(matrix[i][j] == 0){
matrix[0][j] = 0;
matrix[i][0] = 0;
}
}
}

for(int i = 1; i<rows; i++) {
for (int j=1; j< cols; j++) {
if(matrix[0][j] == 0 || matrix[i][0] == 0)
matrix[i][j] = 0;
}
}

if(empty_row0){
for(int i = 0; i < cols; i++){
matrix[0][i] = 0;
}
}

if(empty_col0){
for(int i = 0; i < rows; i++){
matrix[i][0] = 0;
}
}

}
}

class Solution {
public void setZeroes(int[][] matrix) {
boolean setFirstRowToZeros = false;
boolean setFirstColumnToZeros = false;

for(int j = 0; j <= matrix[0].length - 1; j++) {
if(matrix[0][j] == 0) {
setFirstRowToZeros = true;
break;
}
}

for(int i = 0; i <= matrix.length - 1; i++) {
if(matrix[i][0] == 0) {
setFirstColumnToZeros = true;
break;
}
}

for(int i = 1; i <= matrix.length - 1; i++) {
for(int j = 1; j <= matrix[0].length - 1; j++) {
if(matrix[i][j] == 0) {
matrix[i][0] = 0;
matrix[0][j] = 0;
}
}
}

for(int i = 1; i <= matrix.length - 1; i++) {
if(matrix[i][0] == 0) {
for(int j = 1; j <= matrix[0].length - 1; j++) {
matrix[i][j] = 0;
}
}
}

for(int j = 1; j <= matrix[0].length - 1; j++) {
if(matrix[0][j] == 0) {
for(int i = 1; i <= matrix.length - 1; i++) {
matrix[i][j] = 0;
}
}
}

if(setFirstRowToZeros) {
for(int j = 0; j <= matrix[0].length - 1; j++) {
matrix[0][j] = 0;
}
}

if(setFirstColumnToZeros) {
for(int i = 0; i <= matrix.length - 1; i++) {
matrix[i][0] = 0;
}
}
}
}

class Solution {
public void setZeroes(int[][] matrix) {
int iiLength = matrix.length;
if (iiLength == 0) {
return;
}
boolean makeZero;
int jjLength = matrix[0].length;
int[] jj = new int[jjLength];
for (int i = 0; i < matrix.length; i++) {
makeZero = false;
for (int j = 0; j < matrix[0].length; j++) {
if (jj[j] == 1 && matrix[i][j] != 0) {
matrix[i][j] = 0;
} else if (matrix[i][j] == 0) {
makeZero = true;
int tmpI = i;
while (0 <= tmpI) {
matrix[tmpI][j] = 0;
tmpI--;
}
jj[j] = 1;
}
}
if(makeZero) {
matrix[i] = new int[jjLength];
}
}
}
}

class Solution {
public void setZeroes(int[][] matrix) {
int iiLength = matrix.length;
if (iiLength == 0) {
return;
}
boolean makeZero;
int jjLength = matrix[0].length;
int[] jj = new int[jjLength];
for (int i = 0; i < matrix.length; i++) {
makeZero = false;
for (int j = 0; j < matrix[0].length; j++) {
if (jj[j] == 1 && matrix[i][j] != 0) {
matrix[i][j] = 0;
} else if (matrix[i][j] == 0) {
makeZero = true;
int tmpI = i;
while (0 <= tmpI) {
matrix[tmpI][j] = 0;
tmpI--;
}
jj[j] = 1;
}
}
if(makeZero) {
matrix[i] = new int[jjLength];
}
}
}
}


举报

相关推荐

0 条评论