GoLang Solution For LeetCode Problem: Unique Paths
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 7 x 3 grid. How many possible unique paths are there?
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: 1. Right -> Right -> Down 2. Right -> Down -> Right 3. Down -> Right -> Right
Input: m = 7, n = 3 Output: 28
See the full details of the problem Unique Paths at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go