LeetCode Unique Paths

LeetCode Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

Above is a 3 x 7 grid. How many possible unique paths are there?

Note: m and n will be at most 100.




class Solution {
	int uniquePaths(int m, int n) {
		int x = m - 1, y = n - 1;
		int z = x + y, u = x < y ? x : y;
		double ans = 1.0;
		for (int i = 1; i <= u; i++) {
			ans *= z;
			ans /= i;
		return ans;


One thought on “LeetCode Unique Paths

  1. Pingback: LeetCode Unique Paths II | bitJoy > code

Leave a Reply

Your email address will not be published. Required fields are marked *