码迷,mamicode.com
首页 > 其他好文 > 详细

Unique Paths

时间:2014-06-10 18:43:37      阅读:254      评论:0      收藏:0      [点我收藏+]

标签:leetcode   java   array   二维数组   动态规划   

题目

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.

方法

使用DP的思想,逐行计算。
    public int uniquePaths(int m, int n) {
        if (m == 0 || n == 0) {
            return 0;
        }
        int[][] num = new int[m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (i == 0 || j == 0) {
                    num[i][j] = 1;
                } else {
                    num[i][j] = num[i - 1][j] + num[i][j - 1];
                }
            }
        }
        return num[m - 1][n - 1];
    }


Unique Paths,布布扣,bubuko.com

Unique Paths

标签:leetcode   java   array   二维数组   动态规划   

原文地址:http://blog.csdn.net/u010378705/article/details/29829903

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!