LeetCode OJ--Set Matrix Zeroes **

http://oj.leetcode.com/problems/set-matrix-zeroes/

因为空间要求原地，所以一些信息就得原地存储。使用第一行第一列来存本行本列中是否有0.另外对于第一个元素[0][0]，需要额外处理。

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        int flag = ;
        int flag2 = ;
        for(int i = ;i<matrix.size();i++)
            for(int j = ;j<matrix[].size();j++)
            {
                if(matrix[i][j] == )
                {
                    if(j==)
                        flag2 = ;
                    if(i==)
                        flag = ;
                    matrix[][j] = ;
                    matrix[i][] = ;
                }
            }

        //handle row
        for(int j = ;j<matrix[].size();j++)
        {
            if(matrix[][j] == )
                for(int i = ;i<matrix.size();i++)
                    matrix[i][j] = ;
        }
        //handle column
        for(int i = ;i<matrix.size();i++)
        {
            if(matrix[i][]==)
            {
                for(int j = ;j<matrix[].size();j++)
                {
                    matrix[i][j] = ;
                }
            }
        }
        //第一行中有0
        if(flag == )
        {
            for(int j = ;j<matrix[].size();j++)
            {
                matrix[][j] = ;
            }
        }
        //第一列中有0
        if(flag2 ==)
        {
            for(int i = ;i<matrix.size();i++)
                matrix[i][] = ;
        }
        return;
    }
};
int main()
{
    vector<vector<int> > matrix;
    vector<int> row;
    row.push_back();
    matrix.push_back(row);
    row[] = ;
    matrix.push_back(row);
    row[] = ;
    matrix.push_back(row);
    //row.push_back(0);
    //row.push_back(3);
//    row.push_back(4);
    //matrix.push_back(row);

    /*row.clear();
    row.resize(4);
    row[0] = 5;
    row[1] = 6;
    row[2] = 0;
    row[3] = 8;
    matrix.push_back(row);
    row.clear();*/
    Solution myS;
    vector<vector<int> > ans;
    myS.setZeroes(matrix);
    ans = matrix;
    //int ans = myS.longestConsecutive(num);
    return ;
}