[LeetCode97]Set Matrix Zeroes
来源:互联网 发布:网络理财平台哪个好 编辑:程序博客网 时间:2024/06/05 15:14
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.
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?
Analysis:
The solution using O(mn) space is easy, create another flag matrix for each position.
The solution using O(m+n), create two arrays to store specific row and column zero info.
The solution using constant space need us to multiplex use the matrix itself.
Steps:
1. Determine the first row and column is 0 or not.
2. Use matrix first row and column to store 0 information
3. Set matrix 0 according to the first row and column
4. Set first row and column to 0, according to step 1.
Java
public void setZeroes(int[][] matrix) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each test case. boolean firstRow = false, firstColumn = false; for(int i=0; i<matrix.length; i++){ if(matrix[i][0] == 0){ firstColumn = true; break; } } for(int i=0; i<matrix[0].length;i++){ if(matrix[0][i] == 0){ firstRow = true; break; } } 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++){ for(int j=1; j<matrix[0].length;j++){ if(matrix[i][0] == 0 || matrix[0][j]==0){ matrix[i][j] = 0; } } } if(firstColumn){ for(int i=0; i<matrix.length;i++) matrix[i][0] =0; } if(firstRow){ for(int i=0; i<matrix[0].length;i++) matrix[0][i] =0; } }c++
void setZeroes(vector<vector<int> > &matrix) { assert(matrix.size() >0); int row = matrix.size(); int column = matrix[0].size(); bool zeroRow = false, zeroCol = false; for(int i=0; i<column; i++){ if(matrix[0][i] == 0) zeroRow = true; } for(int i=0; i<row; i++){ if(matrix[i][0] == 0) zeroCol = true; } for(int i=1; i<row; i++){ for(int j=1; j<column; j++){ if(matrix[i][j]==0){ matrix[i][0] = 0; matrix[0][j] = 0; } } } for(int i=1; i<row; i++){ for(int j=1; j<column; j++){ if(matrix[i][0]==0 || matrix[0][j]==0) matrix[i][j] = 0; } } if(zeroRow == true){ for(int i=0; i<column;i++){ matrix[0][i] = 0; } } if(zeroCol == true){ for(int i=0; i<row;i++){ matrix[i][0] = 0; } } }
- [LeetCode97]Set Matrix Zeroes
- LeetCode: Set Matrix Zeroes
- Set Matrix Zeroes
- Set Matrix Zeroes
- LeetCode Set Matrix Zeroes
- [Leetcode] Set Matrix Zeroes
- LeetCode: Set Matrix Zeroes
- Set Matrix Zeroes
- Leetcode: Set Matrix Zeroes
- [LeetCode] Set Matrix Zeroes
- Set Matrix Zeroes
- Set Matrix Zeroes
- [LeetCode]Set Matrix Zeroes
- Set Matrix Zeroes
- Set Matrix Zeroes
- Set Matrix Zeroes
- [leetcode]Set Matrix Zeroes
- Leetcode:Set Matrix Zeroes
- 明日边缘 Edge of Tomorrow (2014)旋风下载
- 黑马程序员------毕老师视频笔记第22天------图形化编程(2)
- 黑马程序员------毕老师视频笔记第23-24天------网络编程(1)
- 黑马程序员------毕老师视频笔记第23-24天------网络编程(2)
- 黑马程序员------毕老师视频笔记第23-24天------网络编程(3)
- [LeetCode97]Set Matrix Zeroes
- 消息队列
- 关于AnchorPoint和setPosition
- [Rotate Image48]Rotate Image
- COM原理速成~
- COM组件技术
- Android播放音频相关
- Windows DLL基本原理
- DLL的原理