weixin_43948162的博客

剑指offer 二叉树重建 C++ 牛客网/**Definition for binary treestruct TreeNode {int val;TreeNode *left;TreeNode *right;TreeNode(int x) : val(x), left(NULL), right(NULL) {}};/class Solu...

class Solution {public:int minNumberInRotateArray(vector rotateArray) {if (rotateArray.size() == 0)throw “the vector is empty”;int head = 0;int tail = rotateArray.size() - 1;int Mid = head;whi...

/*struct TreeLinkNode {int val;struct TreeLinkNode *left;struct TreeLinkNode *right;struct TreeLinkNode *next;TreeLinkNode(int x) :val(x), left(NULL), right(NULL), next(NULL) {}};/class Sol...