Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Your goal is to reach the last index in the minimum number of jumps.

Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.

字符串搜索算法，也称字符串匹配算法，目的是在主串中查找模式串。Sunday 算法的核心思想是：在匹配过程中，当两者不匹配时，尽可能多的跳过字符（以模式串末尾的下一位为匹配点），以进行下一步匹配

Write a function to find the longest common prefix string amongst an array of strings.

Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).