- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 【QZMS】4 BFS DFS Depth 树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; *//** * Definition for singly-linked list. * struct ListNod.
2020-07-29 23:40:45
182
原创 【QZMS】3 BST LCA depth树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<vector<int>>.
2020-07-28 23:39:51
141
原创 【QZMS】2 LCA BiNode 树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* lowestCommonAncestor.
2020-07-27 23:33:44
171
原创 【QZMS】LC第31场双周赛
class Solution {public: int count(int x) { if(x < 0) { return 0; } return (x + 1) / 2; } int countOdds(int low, int high) { return count(high) - count(low - 1); }};class Solutio.
2020-07-26 23:45:20
151
原创 快排 冒泡 选择 插入 归并排序算法
快排#include <bits/stdc++.h>using namespace std;void quick_sort(vector<int>&q, int l, int r) { if(l >= r) return; int i = l - 1, j = r + 1, x = q[l + r >> 1]; while(i < j) { do i ++; while(q[i] < x
2020-07-02 22:56:55
154
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人