solved 'Jump Game II' on LeetCode http://oj.leetcode.com/problems/jump-game-ii/
1. first using DP, O(n^2), TLE.
2. split arrays to intervals by taking the maximum reach as the boundary.