My Java solution with Probability Method


  • 0
    Z
    public int uniquePaths(int m, int n) {
        if(m==1||n==1) return 1;
        long sum=1, length=m+n-2;
        for(long i=1; i<=Math.min(m-1,n-1); i++){
            sum=sum*length--/i;
        }
        return (int)sum;
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.