leetcode Set Matrix Zeroes矩阵设置零

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.

click to show follow up.

Follow up:

Did you use extra space?
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)的做法是很简洁的:

void setZeroes(vector<vector<int> > &matrix) {
		int row = matrix.size();
		if (row < 1) return;
		int col = matrix[0].size();
		vector<bool> colRecorder(col);
		vector<bool> rowRecorder(row);

		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < col; j++)
			{
				if (matrix[i][j] == 0)
				{
					rowRecorder[i] = true;
					colRecorder[j] = true;
				}
			}
		}

		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < col; j++)
			{
				if (rowRecorder[i]) matrix[i][j] = 0;
				else if (colRecorder[j]) matrix[i][j] = 0;
			}
		}
	}


利用常数空间也可以:

就需要巧妙地利用原来矩阵的空间,这里利用第一行和第一列保存额外信息:

1 先判断号第一行和第一列是否需要全部置零

2 有任何一个该行或者该列的元素为零那么这个第一行或者第一列的元素必然是零,就保存这个零,最后用来判断整个矩阵的这一行或者这一列是否需要置零。

3 最后再根据前面判断,决定是否把这个第一行和第一列置零。

void setZeroes2(vector<vector<int> > &matrix) 
	{
		int row = matrix.size();
		if (row < 1) return;
		int col = matrix[0].size();
		bool firstRowhasZero = false;
		bool firstColhasZero = false;

		for (int i = 0; i < row && !firstColhasZero; i++)
			if (matrix[i][0] == 0) firstColhasZero = true;	

		for (int i = 0; i < col && !firstRowhasZero; i++)
			if (matrix[0][i] == 0) firstRowhasZero = true;

		for (int i = 0; i < row; i++)
		{
			for (int j = 0; j < col; j++)
			{
				if (matrix[i][j] == 0)
				{
					matrix[i][0] = 0;
					matrix[0][j] = 0;
				}
			}
		}

		//注意:这里从1开始
		for (int i = 1; i < row; i++)
		{
			for (int j = 1; j < col; j++)
			{
				if (matrix[i][0] == 0) matrix[i][j] = 0;
				else if(matrix[0][j] == 0) matrix[i][j] = 0;
			}
		}

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

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

和上面差不多,小小改动一下。

class Solution {
public:
	void setZeroes(vector<vector<int> > &matrix)
	{
		int row = matrix.size();
		if (row < 1) return;
		int col = matrix[0].size();
		bool firstRowhasZero = false;
		bool firstColhasZero = false;

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

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

		for (int i = 0; i < row; i++)
		{
			for (int j = 0; 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)
				for (int j = 1; j < col; j++)
				{
					matrix[i][j] = 0;
				}
		}
		for (int j = 1; j < col; j++)
		{
			if (matrix[0][j] == 0)
				for (int i = 1; i < row; i++)
				{
					matrix[i][j] = 0;
				}
		}

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

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


//2014-2-11 update
	void setZeroes(vector<vector<int> > &matrix) 
	{
		if (matrix.empty() || matrix[0].empty()) return;
		bool row_flag = false, col_flag = false;

		for (int i = 0; i < matrix.size() && !col_flag; i++)
			if (matrix[i][0]==0) col_flag = true;
		for (int i = 0; i < matrix[0].size() && !row_flag; i++)
			if (matrix[0][i]==0) row_flag = true;

		for (int i = 1; i < matrix.size(); i++)
			for (int j = 1; j < matrix[0].size(); j++)
				if (matrix[i][j]==0) matrix[i][0] = matrix[0][j] = 0;

		for (int i = 1; i < matrix.size(); i++)
			if (matrix[i][0]==0) 
				for (int j = 1; j < matrix[0].size(); j++)
					matrix[i][j] = 0;
		for (int j = 1; j < matrix[0].size(); j++)
			if (matrix[0][j]==0)
				for (int i = 1; i < matrix.size(); i++)
					matrix[i][j] = 0;

		if (row_flag)
			for (int i = 0; i < matrix[0].size(); i++)
				matrix[0][i] = 0;
		if (col_flag)
			for (int i = 0; i < matrix.size(); i++)
				matrix[i][0] = 0;
	}




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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值