【Leetcode】Set Matrix Zeroes
来源:互联网 发布:电商网站php 编辑:程序博客网 时间:2024/06/03 21:08
题目链接: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.
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(1),时间复杂度为O(m*n)。
1、判断数组左上边界是否有零
2、扫描除边界外数组元素,若有零在边界处标记
3、根据标记按行列处理边界外元素为0
4、若边界有零,则边界归0
算法:
public void setZeroes(int[][] matrix) {boolean left = false;boolean up = false;for (int i = 0; i < matrix.length; i++) { // 左边界是否有零if (matrix[i][0] == 0) {left = true;}}for (int i = 0; i < matrix[0].length; i++) {// 上边界是否有零if (matrix[0][i] == 0) {up = true;}}for (int i = 1; i < matrix.length; i++) {for (int j = 1; j < matrix[0].length; j++) {if (matrix[i][j] == 0) {// 在边界处标记matrix[i][0] = 0;matrix[0][j] = 0;}}}for (int i = 1; i < matrix.length; i++) {// 根据左边界标记按行处理标记外数组if (matrix[i][0] == 0) {for (int j = 0; j < matrix[0].length; j++) {matrix[i][j] = 0;}}}for (int i = 1; i < matrix[0].length; i++) {// 根据上边界标记按列处理标记外数组if (matrix[0][i] == 0) {for (int j = 0; j < matrix.length; j++) {matrix[j][i] = 0;}}}if (left) {// 处理边界for (int i = 0; i < matrix.length; i++) {matrix[i][0] = 0;}}if (up) {for (int i = 0; i < matrix[0].length; i++) {matrix[0][i] = 0;}}}
0 0
- LeetCode: Set Matrix Zeroes
- LeetCode Set Matrix Zeroes
- [Leetcode] Set Matrix Zeroes
- LeetCode: Set Matrix Zeroes
- Leetcode: Set Matrix Zeroes
- [LeetCode] Set Matrix Zeroes
- [LeetCode]Set Matrix Zeroes
- [leetcode]Set Matrix Zeroes
- Leetcode:Set Matrix Zeroes
- LeetCode-Set Matrix Zeroes
- [leetcode] Set Matrix Zeroes
- LeetCode - Set Matrix Zeroes
- Set Matrix Zeroes leetcode
- 【Leetcode】Set Matrix Zeroes
- 【leetcode】Set Matrix Zeroes
- Leetcode: Set Matrix Zeroes
- Leetcode Set Matrix Zeroes
- LeetCode | Set Matrix Zeroes
- 走迷宫
- 程序猿必须克服的十大编程禁忌
- php入门基础 二
- 内核阅读之浅析Linux2.6.34内核路由数据转发(二)
- 最短路径
- 【Leetcode】Set Matrix Zeroes
- Hadoop中数据序列化的常用方式:SequenceFile, Avro, Thrift, ProtoBuff -- 待完善
- 二分练习
- 电影节
- 小鑫的城堡
- Android监听耳机按键事件
- BZOJ 1087 (状态压缩DP)
- php 入门基础 三
- 数据结构之链表