2dArrays/coding ninjas

LargestRowOrColumn.java

import java.util.Scanner;

public class LargestRowOrColumn {
	public static void findLargest(int mat[][]){
		//Your code goes here
        int min=-2147483648;
        boolean Row=true;
        int largestsum=min;
        int num=0;
        int rows=mat.length;
        
        if(rows==0){
            System.out.println("row 0 "+min);
            return;
        }
        for(int i=0;i<rows;i++){
            int cols=mat[0].length;
            int rowsum=0;
            for(int j=0;j<cols;j++){
                rowsum+=mat[i][j];
            }
            if(rowsum>largestsum){
                largestsum=rowsum;
                num=i;
            }
        }
        int cols=mat[0].length;
        for(int j=0;j<cols;j++){
            int colsum=0;
            for(int i=0;i<rows;i++){
                colsum+=mat[i][j];
            }
            if(colsum>largestsum){
                largestsum=colsum;
                num=j;
                Row=false;
            }
        }
            if(Row==true){
                System.out.println("row "+num+" "+ largestsum);
            }
            else{
                System.out.println("column "+num+" "+ largestsum);
            
        }
        
	}


	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int rows=s.nextInt();
		int cols=s.nextInt();
		int[][] arr=new int[rows][cols];
		for(int i=0;i<rows;i++) {
			for(int j=0;j<cols;j++) {
				arr[i][j]=s.nextInt();
			}
		}
		findLargest(arr);

	}

}