LintCode:不同的路径II

116 篇文章 0 订阅

LintCode:不同的路径II

class Solution:
    """
    @param obstacleGrid: An list of lists of integers
    @return: An integer
    """
    def uniquePathsWithObstacles(self, obstacleGrid):
        # write your code here
        if len(obstacleGrid) == 0:
            return 0
        m = len(obstacleGrid)
        n = len(obstacleGrid[0])
        ans = [[1 for i in range(n)] for i in range(m)]
        i_index = n
        j_index = m
        for i in range(n):
            if obstacleGrid[0][i] == 1:
                i_index = i
                break
        for i in range(i_index, n):
            ans[0][i] = 0

        for j in range(m):
            if obstacleGrid[j][0] == 1:
                j_index = j
                break
        for j in range(j_index, m):
            ans[j][0] = 0

        for i in range(1, m):
            for j in range(1, n):
                if obstacleGrid[i][j] == 1:
                    ans[i][j] = 0
                else:
                    ans[i][j] = ans[i-1][j] + ans[i][j-1]

        return ans[m-1][n-1]
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值