interviewbit-solutions/Pascal Triangle at master · bhonesh1998/interviewbit-solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
vector<vector<int> > Solution::generate(int A) {


     int n=A;

        if(n==0)
        {
                vector < vector<int>  > v;
               // v[0].push_back(0);
                return v;

        }

        else
        {

      vector< vector<int> > a(n);

       int i,j;
            for(i=0;i<n;i++)
            {

               a[i] = vector<int> (n+1);
            for(j=0;j<n+1;j++)
            {
                a[i][j]=0;
            }

            }

            a[0][1]=1;

                 for(i=1;i<n;i++)
            {
            for(j=1;j<n+1;j++)
            {
                a[i][j]=a[i-1][j-1]+a[i-1][j];
            }
            }

            vector < vector<int>  > v(n);


   for(i=0;i<n;i++)
            {
            for(j=1;j<i+2;j++)
            {

                v[i].push_back(a[i][j]);

               //pf("%d ",a[i][j]);
            }
            //pf("\n");
            }

  return v;

        }


}