class Solution { public: vector<int> GetLeastNumbers_Solution(vector<int> input, int k) { if(input.size()<=k) return input; return qsort(input, k,0, input.size()-1); } vector<int> qsort(vector<int>& input,int k,int l,int r){ int i = ...

c++极简单递归代码 public: bool IsBalanced_Solution(TreeNode* pRoot) { if(pRoot == nullptr || (pRoot->left == nullptr && pRoot->right == nullptr)) return true; return judge(pRoot) && judge(pRoot->left) && judge(pRoot->right); } int depth(TreeNo...