Ch1-7: clear the row i and column j iff a[i][j]==0

in this problem, both monish001 and hawstein use O(n^2) solution which first tranverse the char** a to find the a[i][j]==0 and mark that row/col to be: TRUE.

Then the send loop make the TURE row/col to be all 0.

//https://github.com/monish001/CPP-Programs/blob/master/CTCI/1.7Zeros.cpp
//Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column is set to 0.
#include
   
   
    
    
#include
    
    
     
     
using namespace std;
void swap(char &a, char&b){
    std::swap(a,b);
//    cout<
     
     <<" and "<<<" swapped.\n";
}

void print(char** a, int m, int n){
    for(int i=0; i
       
       
         r, c; for(int i=0; i