原创 [LeetCode] Permutation
vector<vector<int> > permute(vector<int> &num) { vector<vector<int>> permutations; if (num.size() <= 1) { permutat
2020-06-26 17:38:59
原创 [LeetCode] Subsets
vector<vector<int>> combine(vector<int> &nums, int k) { vector<vector<int>> combinations; if (k == 0) { vector<int
2020-02-23 06:15:50
原创 [LeetCode] Permutations II
vector<vector<int> > permuteUnique(vector<int> &num) { vector<vector<int>> permutations; if (num.size() <= 1) { p
2020-02-23 06:15:50
原创 [LeetCode] Gas Station
int canCompleteCircuit(vector<int> &gas, vector<int> &cost) { vector<int> gasLeft; for(int i = 0; i < gas.size(); i++
2020-02-23 06:15:50
原创 [LeetCode] Convert Sorted Array to Binary Search Tree
TreeNode *sortedArrayToBST(vector<int> &num) { int n = num.size(); int beg = 0, end = n-1; TreeNode* root = NULL; i
2020-02-23 06:15:50
原创 [LeetCode] Sum Root to Leaf Numbers
題目鏈接 int sumNumbers(TreeNode *root) { vector<TreeNode*> nodes; vector<int> numbers; int sum_numbers = 0; if(root !
2020-02-23 06:15:50
原创 [LeetCode] Minimum Depth of Binary Tree
int minDepth(TreeNode *root) { vector<TreeNode*> nodes; vector<int> depths; int min_depth = 0; if(root != NULL) {
2020-02-23 06:15:50
原创 [LeetCode] Balanced Binary Tree
int height(TreeNode *root) { if(root == NULL) { return 0; } int left_height = height(root->left); int right_heigh
2020-02-23 06:15:50