工作的那些事儿，小梁的blog

摘要：1. 二叉树(binary tree)：最基本树型结构，每个结点最多有两个子节点，分别成为左子节点(left child node)和右子节点(right child node)。相关题目：a. 给定根结点，计算二叉树的最大深度。View Code //递归解法class Solution {public:int maxDepth(TreeNode* root){ if (root == NULL) return 0; if (root->left == NULL && root->right == NULL) return 1; if (root->left 阅读全文

摘要：1. Awk's programming model: The main loop in awk is a routine that reads one line of input from a file and makes it avaiblable for processing. You can use BEGIN/END to execute commands before/after the loop.2. Similar to sed, printing matched line content is the default behavior if no other acti 阅读全文