stloztoeplitz的博客

题目没什么说的就是树的层次遍历，但是要考虑树为空的情况。而且对于Vector必须是先申请一个小Vector，对其操作完成后再将其加入大的Vector中。不能V[i].push_back（）,因为这时候V[i]还不存在。/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left

devcpp代码名字如果太相近就会出现bug#include <iostream>using namespace std;const int maxn = 100;int a[maxn],b[maxn];struct TreeNode { int val; TreeNode* left,*right; TreeNode(int a):val(a),left(NULL)

while写成if debug了半天。/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */vector<TreeNo

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; *//** * Definition for binary tree * struc

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */vector<vector

c++中各类类型与string类型的相互转化http://www.cnblogs.com/nzbbody/p/3504199.html 这道题还是坑了我这么久，一是忘了保留多种可能性，二是忘记了出来多个0的情况。后来用string来处理的确是方便了许多。/** * Definition for binary tree * struct TreeNode { * int val; *

长度居然是唯一的确定作用子树的方法，因为左右子树的左点和右点可能不存在，而找根结点又不是那么方便，而长度居然成了唯一靠谱的了。#include <iostream>#include <vector>using namespace std; struct TreeNode { int val; TreeNode *left; TreeNode *right;

学会递归地去解决问题，明白每层自己要做什么，层与层的相关性。/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NU

求后续#include &lt;bits/stdc++.h&gt;using namespace std;int const maxn=1100;int a[8][8];int vis[8];vector&lt;string&gt; ans;void f(string ins,string post){ if(ins.size()==0) return ; ...