zwfars的专栏

链接：https://www.nowcoder.com/profile/8740530/codeBookDetail?submissionId=9156674 来源：牛客网 class Solution { public: int InversePairs(vector& data) { tem = data; int high = data.size()

class Solution { public: vector > FindPath(TreeNode* root, int expectNumber) { vector > ans; vector test; dfs(ans, test, root, expectNumber); return ans; } void dfs(vector > &ans, vector &t

class Solution { public: RandomListNode* Clone(RandomListNode* pHead) { map aux; RandomListNode* cur = new RandomListNode(pHead->label); RandomListNode* head = cur; RandomListNode* tem = pHe

class Solution { public: vector Permutation(string str) { sort(str.begin(), str.end()); string tem = str; vector ans; while (tem != "") { ans.push_back(tem); getnext(tem); } return

class Solution { public: int NumberOf1Between1AndN_Solution(int n) { int divide = 1; int cur; int ans = 0; int pre; int remain; while (n >= divide) { remain = n % divide; pre = n /

bool mycmp(const string &A, const string &B) { return (A + B) < (B + A); } class Solution { public: string PrintMinNumber(vector numbers) { vector tem; string ans; int len = numbers.size();

class Solution { public: int GetUglyNumber_Solution(int index) { int cur1 = 0; int cur2 = 0; int cur3 = 0; vector tem; int cur; tem.push_back(1); for (int i = 1; i <= index; i++) { c

class Solution { public: int TreeDepth(TreeNode* pRoot) { if(!pRoot) return 0; return max(TreeDepth(pRoot->left),TreeDepth(pRoot->right))+1; } };

class Solution { public: bool IsBalanced_Solution(TreeNode* root) { if(!root) return true; int tem = getheight(root->left) - getheight(root->right); int ans = (