Created
June 21, 2013 02:53
-
-
Save luoxiaoxun/5828501 to your computer and use it in GitHub Desktop.
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?
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| C++: | |
| class Solution { | |
| public: | |
| void setZeroes(vector<vector<int> > &matrix) { | |
| // Start typing your C/C++ solution below | |
| // DO NOT write int main() function | |
| bool row=false; | |
| bool col=false; | |
| for(int i=0;i<matrix.size();i++) | |
| if(matrix[i][0]==0){ | |
| row=true; | |
| break; | |
| } | |
| for(int j=0;j<matrix[0].size();j++) | |
| if(matrix[0][j]==0){ | |
| col=true; | |
| break; | |
| } | |
| for(int i=0;i<matrix.size();i++) | |
| for(int j=0;j<matrix[0].size();j++) | |
| if(matrix[i][j]==0){ | |
| matrix[i][0]=0; | |
| matrix[0][j]=0; | |
| } | |
| for(int i=1;i<matrix.size();i++) | |
| if(matrix[i][0]==0) | |
| for(int j=0;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=0;i<matrix.size();i++) | |
| matrix[i][j]=0; | |
| if(row) | |
| for(int i=0;i<matrix.size();i++) | |
| matrix[i][0]=0; | |
| if(col) | |
| for(int j=0;j<matrix[0].size();j++) | |
| matrix[0][j]=0; | |
| } | |
| }; | |
| Java: | |
| public class Solution { | |
| public void setZeroes(int[][] matrix) { | |
| // Start typing your Java solution below | |
| // DO NOT write main() function | |
| boolean row=false; | |
| boolean col=false; | |
| for(int i=0;i<matrix.length;i++) | |
| if(matrix[i][0]==0){ | |
| row=true; | |
| break; | |
| } | |
| for(int j=0;j<matrix[0].length;j++) | |
| if(matrix[0][j]==0){ | |
| col=true; | |
| break; | |
| } | |
| for(int i=0;i<matrix.length;i++) | |
| for(int j=0;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 j=1;j<matrix[0].length;j++) | |
| if(matrix[0][j]==0) | |
| for(int i=0;i<matrix.length;i++) | |
| matrix[i][j]=0; | |
| if(row) | |
| for(int i=0;i<matrix.length;i++) | |
| matrix[i][0]=0; | |
| if(col) | |
| for(int j=0;j<matrix[0].length;j++) | |
| matrix[0][j]=0; | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment