CODE 60: Set Matrix Zeroes

本文介绍了一种高效的算法,用于在给定的矩阵中如果某个元素为0,则将其所在行和列的所有元素设置为0。该算法采用原地操作的方式,并探讨了如何在不使用额外空间的情况下实现这一功能。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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?

 

	public void setZeroes(int[][] matrix) {
		// Note: The Solution object is instantiated only once and is reused by
		// each test case.
		int zeroH = -1;
		int rows = matrix.length;
		int cols = matrix[0].length;
		if (0 == matrix[0][0]) {
			zeroH = 0;
		}
		for (int i = 1; i < rows; i++) {
			if (0 == matrix[i][0]) {
				matrix[0][0] = 0;
				break;
			}
		}
		for (int i = 1; i < cols; i++) {
			if (0 == matrix[0][i]) {
				zeroH = 0;
				break;
			}
		}
		for (int i = 1; i < rows; i++) {
			for (int j = 1; j < cols; j++) {
				if (0 == matrix[i][j]) {
					matrix[i][0] = 0;
					matrix[0][j] = 0;
				}
			}
		}

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


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值