link on JianShu 栈stack 173. Binary Search Tree Iterator Medium Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the next smallest number in the BST. Example: BSTIterator iterator = new BSTIterator(root); iterator.next(); // return 3 iterator.next(); // return 7 iterator.hasNext(); // return true iterator.next(); // return 9 iterator.hasNext();
link on JianShu 栈stack 155. Min Stack Easy Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top element. getMin() – Retrieve the minimum element in the stack. Example: MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3);
link on JianShu 原生Monkey： 源码参考 实现原理：Java反射获取系统接口，注入事件 http://androidxref.com/5.0.0_r2/xref/development/cmds/monkey/src/com/android/commands/monkey/Monkey.java 控制业务逻辑； http://androidxref.com/5.0.0_r2/xref/development/cmds/monkey/src/com/android/commands/monkey/MonkeyMotionEvent.java 事件注入实现 功能—— 系统自带支持；随机点击、滑
给孩子看的西方政治学（未完） 李宇晖 (微博/Twitter/Instagram：@DrHueyLi) 版本说明：此书稿写于2014-2015年，
link on JianShu ReadHub上看到这样两条记录—— 搜索对照了一下原文，Sina的标题起得好，对文章进行了编译，腾讯比较忠实地翻译了原文 IBM称霸27
