技術標籤：Leetcode

73. 矩陣置零

除了煩了點，別的還好

class Solution {
public:
void makeRowZero(vector<vector<int>>& matrix,int row) {

	for (int j = 0; j < matrix[0].size(); j++) {
		matrix[row][j] = 0;
	}

}
void makeColZero(vector<vector<int>>& matrix, int col) {
	for (int i = 0; i <
 
 matrix.size(); i++) {
		matrix[i][col] = 0;
	}
}
void setZeroes(vector<vector<int>>& matrix) {
	bool colZero = 0;
	bool rowZero = 0;
	int row = matrix.size();
	int col = matrix[0].size();
	//第一列
	for (int i = 0; i < row; i++) {
		if (matrix[i][0] == 0) {
			colZero = 1;
			break;
		}
	}
	//第一行
 

	for (int i = 0; i < col; i++) {
		if (matrix[0][i] == 0) {
			rowZero = 1;
			break;
		}
	}
	//遍歷
	for (int i = 1; i < row; i++) {
		for (int j = 1; j < col; j++) {
			if (matrix[i][j] == 0) {
				matrix[i][0] = 0;
				matrix[0][j] = 0;
			}
		}		
	}

	for (int i = 1; i < row; i++) {
		if (matrix[
 
i][0] == 0) {
			makeRowZero(matrix, i);
		}
	}

	for (int j = 1; j < col; j++) {
		if (matrix[0][j] == 0) {
			makeColZero(matrix, j);
		}
	}

	//重新弄
	if (rowZero == 1) {
		makeRowZero(matrix, 0);
	}
	if (colZero == 1) {
		makeColZero(matrix, 0);
	}

}
};