sundawei2016的博客

Boyer Moore Algorithm是从最后一位向前开始查找。如果 text 位置上的字母 没有出现在 patter 里的话就向右shift 一个pattern的长度如果出现的话，就看情况这样定义每个在 text 里的字母该 shift 的情况 for (int i = 0; i < k; i++) { table[pattern[i]] = k - i - 1;

198. House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them

Preorder Traversal:public List preorderTraversal(TreeNode root) { List result = new ArrayList<>(); Stack stack = new Stack<>(); TreeNode p = root; while(!stack.isEmpty() || p != null