leetcode-unique paths 2

The feeling of depending on oneself and AC is just great.

#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int> > &obstacleGrid) {
        vector<vector<int>> d(obstacleGrid.size(), vector<int>(obstacleGrid[0].size(), 0));
        for (int i = 0; i < d.size(); i++)
        {
            if (obstacleGrid[i][0] != 1)
                d[i][0] = 1;
            else break;
        }
        for (int i = 0; i < d[0].size(); i++)
        {
            if (obstacleGrid[0][i] != 1)
                d[0][i] = 1;
            else break;
        }
        for (int i = 1; i < obstacleGrid.size(); i++)
        {
            for (int j = 1; j < obstacleGrid[i].size(); j++)
            {
                if (obstacleGrid[i][j] != 1)///////////////////////////////////////
                {
                    d[i][j] = d[i - 1][j] + d[i][j - 1];
                }
                //cout << d[i][j] << " ";
            }
            //cout << endl;
        }
        return d[obstacleGrid.size()-1][obstacleGrid[0].size()-1];
    }
};
int main()
{
    Solution s;
    vector<vector<int>> obstacleGrid;
    int a0[] = { 0, 0, 0 };
    int a1[] = { 0, 1, 0 };
    int a2[] = { 0, 0, 0 };
    obstacleGrid.push_back(vector<int>(a0, a0 + 3));
    obstacleGrid.push_back(vector<int>(a1, a1 + 3));
    obstacleGrid.push_back(vector<int>(a2, a2 + 3));

    //print vector<vector<int>>
    //for (int i = 0; i < obstacleGrid.size(); i++)
    //{
    //    for (int j = 0; j < obstacleGrid[i].size(); j++)
    //    {
    //        cout << obstacleGrid[i][j]<<" ";
    //    }
    //    cout << endl;
    //}
    cout << s.uniquePathsWithObstacles(obstacleGrid) << endl;
    return 0;
}