[Coding Made Simple] Total ways in matrix

Given a 2 dimensional matrix, how many ways you can reach bottom right from top left provided you can only move down and right.

 

public class TotalWaysInMatrix {
    public int getTotalWays(int[][] matrix) {
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return 0;
        }
        int[][] T = new int[matrix.length][matrix[0].length];
        for(int i = 0; i < T.length; i++) {
            T[i][0] = 1;
        }
        for(int j = 0; j < T[0].length; j++) {
            T[0][j] = 1;
        }
        for(int i = 1; i < T.length; i++) {
            for(int j = 1; j < T[0].length; j++) {
                T[i][j] = T[i - 1][j] + T[i][j - 1];
            }
        }
        return T[T.length - 1][T[0].length - 1];
    }
}