Package g0001_0100.s0062_unique_paths

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    62 - Unique Paths.

    Medium

    There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

    Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right corner.

    The test cases are generated so that the answer will be less than or equal to <code>2 * 10<sup>9</sup></code>.

    Example 1:

    Input: m = 3, n = 7

    Output: 28

    Example 2:

    Input: m = 3, n = 2

    Output: 3

    Explanation: From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:

    • Right -> Down -> Down

    • Down -> Down -> Right

    • Down -> Right -> Down

    Constraints:

    • 1 &lt;= m, n &lt;= 100

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer uniquePaths(Integer m, Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait