LeetCode 73 — Set Matrix Zeroes（C++ Java Python）

题目： http://oj.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?

题目翻译：

给定一个m x n矩阵，如果一个元素是0，设置它所在的整个行和列为0。原地进行。
更进一步：
你使用额外空间了吗？
使用O(mn)空间的直接解法可能是一个坏主意。
一个简单的改进需要O(m + n)的空间，但仍然不是最好的解法。
你可以设计一个常数空间的解法吗？

分析：
        复用第一行和第一列。
C++实现：

class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
    	const int m = matrix.size();
    	const int n = matrix[0].size();
    	bool row = false;
    	bool column = false;

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

    	for(int j = 0; j < n; ++j)
    	{
    		if(matrix[0][j] == 0)
    		{
    			column = true;
    			break;
    		}
    	}

    	for(int i = 1; i < m; ++i)
    		for(int j = 1; j < n; ++j)
    		{
    			if(matrix[i][j] == 0)
    			{
    				matrix[0][j] = 0;
    				matrix[i][0] = 0;
    			}
    		}

    	for(int i = 1; i < m; ++i)
    	{
    		if(matrix[i][0] == 0)
    		{
    			for(int j = 1; j < n; ++j)
    			{
    				matrix[i][j] = 0;
    			}
    		}
    	}

    	for(int j = 1; j < n; ++j)
    	{
    		if(matrix[0][j] == 0)
    		{
    			for(int i = 1; i < m; ++i)
    			{
    				matrix[i][j] = 0;
    			}
    		}
    	}

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

    	if(column)
    	{
    		for(int j = 0; j < n; ++j)
    		{
    		    matrix[0][j] = 0;
    		}
    	}
    }
};

Java实现：

public class Solution {
    public void setZeroes(int[][] matrix) {
        int m = matrix.length;
		int n = matrix[0].length;
		boolean row = false;
		boolean column = false;

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

		for (int j = 0; j < n; ++j) {
			if (matrix[0][j] == 0) {
				column = true;
				break;
			}
		}

		for (int i = 1; i < m; ++i)
			for (int j = 1; j < n; ++j) {
				if (matrix[i][j] == 0) {
					matrix[i][0] = 0;
					matrix[0][j] = 0;
				}
			}

		for (int i = 1; i < m; ++i) {
			if (matrix[i][0] == 0) {
				for (int j = 1; j < n; ++j) {
					matrix[i][j] = 0;
				}
			}
		}

		for (int j = 1; j < n; ++j) {
			if (matrix[0][j] == 0) {
				for (int i = 1; i < m; ++i) {
					matrix[i][j] = 0;
				}
			}
		}

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

		if (column) {
			for (int j = 0; j < n; ++j) {
				matrix[0][j] = 0;
			}
		}
    }
}

Python实现：

class Solution:
    # @param matrix, a list of lists of integers
    # RETURN NOTHING, MODIFY matrix IN PLACE.
    def setZeroes(self, matrix):
        m = len(matrix)
        n = len(matrix[0])
        row = False
        column = False
        
        for i in range(m):
            if matrix[i][0] == 0:
                row = True
                break
        for j in range(n):
            if matrix[0][j] == 0:
                column = True
                break
        
        for i in range(1, m):
            for j in range(1, n):
                if matrix[i][j] == 0:
                    matrix[i][0] = 0
                    matrix[0][j] = 0
        
        for i in range(1, m):
            if matrix[i][0] == 0:
                for j in range(1, n):
                    matrix[i][j] = 0
        
        for j in range(1, n):
            if matrix[0][j] == 0:
                for i in range(1, m):
                    matrix[i][j] = 0
                
        if row:
            for i in range(0, m):
                matrix[i][0] = 0
                
        if column:
            for j in range(0, n):
                matrix[0][j] = 0

        感谢阅读，欢迎评论！