GreenTeemo的博客

void merge_sort(vector<int>& A, int l, int r){ if(l < r){ int m = (l+r) / 2; merge_sort(A, l, m); merge_sort(A, m+1, r); merge...

int search(vector&lt;int&gt;&amp; nums, int target) { int l = 0, r = nums.size()-1; while(l &lt;= r){ int m = (l+r) / 2; if(nums[m] == target) return m; ...

1. DFS - use recursion void dfs (TreeNode* root) { if(root){ cout &lt;&lt; root-&gt;val &lt;&lt; ' '; dfs(root-&gt;left); dfs(root-&gt;right);...

#include <iostream> #include <vector> using namespace std; void output(vector<int> a){ for(int i : a) cout << i << ','; cout << endl; } void qso...

参考 先序遍历 法一 void dlr(TreeNode* root) { if(!root) return; stack<TreeNode*> stk; stk.push(root); while(!stk.empty()){ TreeNode *node = stk.top(); cout <&lt...