FilesExpand file tree

 master

/

code4.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

59 lines (52 loc) · 1.02 KB

 master

/

code4.cpp

Top

File metadata and controls

• Code
• Blame

59 lines (52 loc) · 1.02 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

53

54

55

56

57

58

59

#include <stdio.h>

#include <vector>

#include <string>

#include <vector>

#include <list>

#include <map>

#include <set>

#include <queue>

#include <deque>

#include <stack>

#include <bitset>

#include <algorithm>

#include <functional>

#include <numeric>

#include <utility>

#include <sstream>

#include <iostream>

#include <iomanip>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <ctime>

using namespace std;

//给定n，生成所有不重复的 BSTs，里面节点所包含的值必须个别为 1 到 n。输入是n，输出是list of <Node *>。

int count(int n )

{

if ( n <= 0 )

return 0;

if ( n == 1 )

return 1;

if ( n == 2 )

return 2;

int* temp = new int[n];

if ( temp == NULL )

return 0;

temp[0] = 1;

temp[1] = 2;

for ( int i = 2; i < n ; i++)

{

temp[i] = 0;

for ( int j = 0; j <= i; j++)

{

if ( j == 0 || j == i)

temp[i] += temp[i-1];

else

temp[i] += temp[j-1] * temp[i-j - 1];

}

}

int res = temp[n-1];

delete[] temp;

return res;

}