Leetcode#62Unique Paths

标签：possible   either   trying   robot   

Unique Paths

 Total Accepted: 44417 Total Submissions: 135663My Submissions

Question Solution 

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.

分析：采用动态规划求解 

public class Solution {

    public int uniquePaths(int m, int n) {

        int[][] x=new int[m][n];

for(int i=0;i<m;i++)

for(int j=0;j<n;j++)

x[i][j]=1;

for(int i=1;i<m;i++)

for(int j=1;j<n;j++)

x[i][j]=x[i][j-1]+x[i-1][j];

        int s=x[m-1][n-1];

        return s;

    }

}

Leetcode#62Unique Paths

标签：possible   either   trying   robot   

原文地址：http://7061299.blog.51cto.com/7051299/1653056