Maximum Square Matrix with All Zeros

/*
Given an NxM matrix that contains only 0s and 1s, find out the size of the maximum square sub-matrix with all 0s. You need to return the size of the square matrix with all 0s.

Input format :
The first line of the test case contains two integer values, 'N' and 'M', separated by a single space. They represent the 'rows' and 'columns' respectively.
Second-line onwards, the next 'N' lines or rows represent the ith row values.
Each of the ith rows constitutes column values separated by a single space (Either 0 or 1).

Output Format:
Print the size of maximum square sub-matrix.

Constraints :
0 <= N <= 10^4
0 <= M <= 10^4
Time Limit: 1 sec

Sample Input 1:
3 3
1 1 0
1 1 1
1 1 1
Sample Output 1:
1

Sample Input 2:
4 4
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
Sample Output 2:
4
*/

public class Solution {
	

	public static int findMaxSquareWithAllZeros(int[][] input){
        
	/* Your class should be named Solution.
	 * Don't write main() function.
	 * Don't read input, it is passed as function argument.
	 * Return output and don't print it.
	 * Taking input and printing output is handled automatically.
	 */
     int m=input.length;
     if (m==0)
         return 0;
        
     int n=input[0].length;
     if (n==0)
         return 0;
    
     int[][] dp = new int[m][n];
     int maxVal=0;
     
     for (int i=0;i<n;i++)
     {
         if (input[0][i]==0)
         {
             dp[0][i]=1;
         }
     }
     
     for (int i=0;i<m;i++)
     {
         if (input[i][0]==0)
         {
             dp[i][0]=1;
         }
     }
        
     for (int i=1;i<m;i++)
     {
         for (int j=1;j<n;j++)
         {
             if(input[i][j]==0)
             {
                 int ans1=dp[i-1][j];
                 int ans2=dp[i][j-1];
                 int ans3=dp[i-1][j-1];
                 
                 dp[i][j]=Math.min(ans1,Math.min(ans2,ans3))+1;
             }
             if (dp[i][j]>maxVal)
             	maxVal=dp[i][j];
         }
         
     }
     
     return maxVal;
	
	}
}