class Solution { public int[] rowAndMaximumOnes(int[][] mat) { int m = mat.length; int n = mat[0].length; int row = 0; int max = 0; for(int i=0;i<m;i++) { int temp = 0; for(int j=0;j<n;j++) { if(mat[j]==1) { temp++; } } if(temp>max) { row = i; max = temp; } }return new int[]{row, max}; }}