weixin_42976216的博客

//左叶子之和//计算所有给定二叉树所有左叶子之和/* 3 / \ 9 20 / \ 15 17*///在这个二叉树中，有两个左叶子，分别是9和15，所有返回24。#include <stdio.h>#include <stdlib.h>#include <iostream>using namespace std;typedef struct BiTNode{ int data; str.

// [-10,-3,0,5,9]/* 0 / \ -3 9 / / -10 5*/#include <stdio.h>#include <iostream>using namespace std;typedef struct BiTNode{ int val; BiTNode *left,*right;}BiTNode,*BiTree;BiTNode *Creat.

#include <stdio.h>#include <stdlib.h>#include <iostream>using namespace std;typedef struct BiTNode{ int data; struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;void CreateBiTree(BiTree &T){ int ch; cin>>c

/*输入："(()())(())"输出："()()()"解释：输入字符串为 "(()())(())"，原语化分解得到 "(()())" + "(())"，删除每个部分中的最外层括号后得到 "()()" + "()" = "()()()"。*/#include <stdio.h>#include <stdlib.h>#include <string.h>#include <iostream>using namespace std;#de..

#include<string.h>#include<stdio.h>#include<malloc.h>#include <iostream>using namespace std;//给定一种规律pattern和一个字符串str,判断str是否遵循相同的规律。//这里的遵循指完全匹配,例如:pattern里的每个字母和字符串st...

#include <stdio.h>#include <stdlib.h>#include <iostream>using namespace std;bool hasGroupsSizeX(int* deck, int deckSize){ int i,j,x; int num=1; int max[100]; i...