leetcode+DP，这个DP方程我想出来了

点击打开链接

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<math.h>
#include<vector>
using namespace std;
class Solution {
public:
    int uniquePathsWithObstacles(vector< vector<int> >& obstacleGrid){
        if(obstacleGrid.size()==0){
            return 0;
        }
        int m=obstacleGrid.size(),n=obstacleGrid[0].size();
        int i=0,j=0,Dp[m+5][n+5];
        memset(Dp,0,sizeof(Dp));
        for(i=0;i<m;i++){
            if(obstacleGrid[i][0]==1){
                while(i<m){
                    Dp[i][0]=0;
                    i+=1;
                }
            }
            Dp[i][0]=1;
        }
        for(j=0;j<n;j++){
            if(obstacleGrid[0][j]==1){
                while(j<n){
                    Dp[0][j]=0;
                    j+=1;
                }
            }
            Dp[0][j]=1;
        }
        for(i=1;i<m;i++){
            for(j=1;j<n;j++){
                if(obstacleGrid[i][j]==1){
                    Dp[i][j]=0;
                }
                else{
                    Dp[i][j]=Dp[i-1][j]+Dp[i][j-1];
                }
            }
        }
        return Dp[m-1][n-1];
    }
};
int main()
{
    Solution temple;
    vector< vector<int> > res;
    vector<int> v1,v2,v3;
    v1.push_back(0); v1.push_back(0); v1.push_back(0);
    v2.push_back(0); v2.push_back(1); v2.push_back(0);
    v3.push_back(0); v3.push_back(0); v3.push_back(0);
    res.push_back(v1); res.push_back(v2);res.push_back(v3);
    cout<<temple.uniquePathsWithObstacles(res)<<endl;
    return 0;
}