bob的博客

原题链接：https://leetcode.cn/problems/delete-nodes-and-return-forest/这题有点难度，对于任意节点，需要将该节点的状态传递给子节点(parentExist)，并且返回给父节点 (return del)class Solution {public: vector<TreeNode*> res; set<int> st; vector<TreeNode*> delNodes(TreeNo

原题链接：https://leetcode.cn/problems/sort-the-jumbled-numbers/vector<int> mp;int getMap(int a) { int x = 0, m = 1; do { int t = a%10; a /= 10; x += mp[t]*m; m *= 10; } while(a); return x;}bool cmp(int

原题链接：https://leetcode.cn/problems/permutation-ii-lcci/dfs + 回溯class Solution {public: set<string> st; vector<int> visited; string s; int n; vector<string> permutation(string S) { s = S; n = S.size();

原题链接：https://leetcode.cn/problems/pairs-of-songs-with-total-durations-divisible-by-60/通过余数来求解，并且余数为0和为30的要单独讨论class Solution {public: int numPairsDivisibleBy60(vector<int>& time) { map<int, vector<int>> vec; for

使用递归来做class Solution {public: vector<int> in_order, post_order; unordered_map<int, int> in_mp; int idx; TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) { in_order = inorder;

git clean -fd

原题链接：https://leetcode.cn/problems/create-binary-tree-from-descriptions/class Solution {public: TreeNode* createBinaryTree(vector<vector<int>>& descriptions) { unordered_map<int, TreeNode*> mp; unordered_map<in

原题链接：https://leetcode.cn/problems/t9-lcci/class Solution {public: vector<string> getValidT9Words(string num, vector<string>& words) { vector<char> vec= {'2', '2', '2', '3', '3', '3', '4', '4', '4', '5', '5', '5', '6', '6

使用递归做的，当然也可以用栈做class Solution {public: string decodeString(string s) { int i = 0; return dfs(s, i); } string dfs(string s, int& i) { int n = s.size(); string res = ""; while (i < n) {

在work节点mkdir .kube将master节点的文件拷贝过来scp master:/root/.kube/config .kube/原文链接：https://blog.csdn.net/u014089832/article/details/108429566

原题链接：https://leetcode-cn.com/problems/most-common-word/class Solution {public: string mostCommonWord(string paragraph, vector<string>& banned) { unordered_map<string, int> mp, ban; for (auto b : banned) { b

原题链接： https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists/class Solution {public: vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) { map<string, int> mp1; map<i

if [ command ]; then 语句1fi如果command返回0，这if判断成功，执行语句1，否则跳出

git log --author="Roman Inflianskas" | tig

如果是完全相同的两个image，则如执行docker build;docker load不会更新，仍使用之前的image如果是不同的两个image，但是image的repositiory:tag是相同的，则会把旧镜像置为none:none，若之后再用到该旧镜像，则直接改repositiory:tag名，并不做更新。...

tmux配置文件vim ~/.tmux.conf使配置文件生效tmux source-file ~/.tmux.conf

1、 查看当前用户组中是否有docker组sudo cat /etc/group | grep docker2、 如果没有则创建sudo groupadd docker3、sudo usermod -aG docker $USERsudo usermod -aG dockerroot $USER4、 退出用户重连即可

1.查看远程分支和本地分支的对应关系:git remote show origin 2.删除远程已经删除过的分支:git remote prune origin