从历史看组织 《从历史看组织》 一本很薄的书，只有 246 页，一两天就可以翻完，作者是著名历史学家许倬云。简单来说，这本书可以概括为从组织、管理的角度，看中国历史，把历朝历代都看做一个公司，分析其在组织管理上的成败得失。 我想重点记录下“人”对组织的影响。 从历史中可以学到，没有一劳永逸的制度，也没有终生智慧的领导，对于所有的制度，不仅要看短期，还要看可持续性。 一个人掌权的时间不能太久，因为一... 2021-10-221 min read
ARTS #124 Algorithm 本周选择的算法题是：Combination Sum III。 规则 Find all valid combinations of k numbers that sum up to n such that the following conditions are true: Only numbers 1 through 9 are used. Each n... 2021-10-164 min read
ARTS #123 Algorithm 本周选择的算法题是：Burst Balloons。 规则 You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represented by an array nums. You are asked to burst all the... 2021-10-093 min read
ARTS #122 Algorithm 本周选择的算法题是：Break a Palindrome。 规则 Given a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulti... 2021-10-024 min read
ARTS #121 Algorithm 本周选择的算法题是：Sudoku Solver。 规则 Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: Each of the digits 1-9 ... 2021-09-264 min read
2021 Q3 阅读记录 这个季度读了三本书： 重新定义团队，阅读笔记见: Google 工作法 估值的标尺 计算机是怎样跑起来的，阅读笔记见: ARTS #120 其中两本写过简短的阅读笔记了。《估值的标尺》也是一本特别务实的书，我很喜欢这一段： 这个世界上每一座山川，每一片星云，每一个凡人都与众不同。人生是一个人的旅行，再平凡也是“限量版”。不管经历了怎样的风吹雨打，不管走了多少里山路... 2021-09-251 min read
ARTS #120 Algorithm 本周选择的算法题是：Majority Element。 规则 Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume tha... 2021-09-182 min read
ARTS #119 Algorithm 本周选择的算法题是：Word Break。 规则 Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note... 2021-09-113 min read
ARTS #118 Algorithm 本周选择的算法题是：Contains Duplicate。 规则 Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1: ... 2021-09-042 min read
ARTS #117 Algorithm 本周选择的算法题是：Target Sum。 规则 You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols '+' and '-' before each in... 2021-08-283 min read