LeetCode 62 --- Unique Paths

public class Problem62 {

public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(uniquePaths(5, 2));
}
public static int uniquePaths(int m, int n) {
int[][] a=new int[m]
;
a[0][0]=1;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
int k1=0,k2=0;
if(i!=0) k1=a[i-1][j];
if(j!=0) k2=a[i][j-1];
if(k1+k2!=0) a[i][j]=k1+k2;

}
}
return a[m-1][n-1];
}

}