FilesExpand file tree

master

/

pascalTriangle.II.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (45 loc) · 1.06 KB

master

/

pascalTriangle.II.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (45 loc) · 1.06 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

// Source : https://oj.leetcode.com/problems/pascals-triangle-ii/

// Author : Hao Chen

// Date : 2014-06-18

/**********************************************************************************

*

* Given an index k, return the kth row of the Pascal's triangle.

*

* For example, given k = 3,

* Return [1,3,3,1].

*

* Note:

* Could you optimize your algorithm to use only O(k) extra space?

*

*

**********************************************************************************/

#include <stdlib.h>

#include <vector>

#include <iostream>

using namespace std;

vector<int> getRow(int rowIndex) {

vector<int> v(rowIndex+1, 0);

v[0]=1;

for (int i=0; i<rowIndex; i++){

for(int j=i+1; j>0; j--){

v[j] += v[j-1];

}

}

return v;

}

void printVector( vector<int> pt)

{

cout << "{ ";

for(int j=0; j<pt.size(); j++){

cout << pt[j] << ", ";

}

cout << "} " << endl;

}

int main(int argc, char** argv)

{

int n = 3;

if (argc>1) {

n = atoi(argv[1]);

}

printVector(getRow(n));

}