XITMan的博客

字符流中第一个不重复的字符 class Solution { public: int str[128]; queue<char> myQueue; //Insert one char from stringstream void Insert(char ch) { str[ch-'\0']++; if(1==str[ch-'\0']) { myQueue.push(ch);

[剑指Offer]二叉搜索树的第k个节点 /* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } }; */ class Solution { public: int index=0; TreeNode* KthNode(Tr

方法一：遍历（遇到k开始计数，遇到不是k并且计数器有值的break即可） class Solution { public: int GetNumberOfK(vector<int> data ,int k) { int count=0; for(std::vector<int>::iterator it=data.begin();it!=data.end();it++) { if(*it==k)

（递归）如果左或者右节点不为空就向下遍历树找到最大深度即可。 /* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) { } };*/ class Solution { public: int TreeDepth(TreeNode* pRoot) { if(pRoo