Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

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; }

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