package LeetCode;/**
* @Classname UniquePaths
* @Description TODO
* @Date 19-2-28 上åˆ10:59
* @Created by mao
*/
public class UniquePaths {
public int uniquePaths(int m, int n) {
int[][] path=new int[m][n];
if(m==1 || n==1){
return 1;
}
for(int i=0;i