Odd Even Jump

You are given an integer array A.  From some starting index, you can make a series of jumps.  The (1st, 3rd, 5th, ...) jumps in the series are called odd numbered jumps, and the (2nd, 4th, 6th, ...) jumps in the series are called even numbered jumps.

You may from index i jump forward to index j (with i < j) in the following way:

• During odd numbered jumps (ie. jumps 1, 3, 5, ...), you jump to the index j such that A[i] <= A[j] and A[j] is the smallest possible value.  If there are multiple such indexes j, you can only jump to the smallest such index j.
• During even numbered jumps (ie. jumps 2, 4, 6, ...), you jump to the index j such that A[i] >= A[j] and A[j] is the largest possible value.  If there are multiple such indexes j, you can only jump to the smallest such index j.
• (It may be the case that for some index i, there are no legal jumps.)

A starting index is good if, starting from that index, you can reach the end of the array (index A.length - 1) by jumping some number of times (possibly 0 or more than once.)

Return the number of good starting indexes. 

Example 1:

Input: [10,13,12,14,15]
Output: 2
Explanation: 
From starting index i = 0, we can jump to i = 2 (since A[2] is the smallest among A[1], A[2], A[3], A[4] that is greater or equal to A[0]), then we can't jump any more.
From starting index i = 1 and i = 2, we can jump to i = 3, then we can't jump any more.
From starting index i = 3, we can jump to i = 4, so we've reached the end.
From starting index i = 4, we've reached the end already.
In total, there are 2 different starting indexes (i = 3, i = 4) where we can reach the end with some number of jumps.

思路：这题说的意思就是 odd跳，是上升跳，跳到最小的第一个比自己大的，even跳，是下降跳，跳到最大的第一个比自己小的。

第一个最大，第一个最小，treemap可以完成，这个有重复计算，所以用dp，从后往前扫描。状态转移方程是:

dp[i][0] = dp[k][1], 二维数组，因为要记录上升和下降的两种可能性， 0代表odd，上升跳，1代表even，下降跳；

dp[i][1] = dp[k][0], k > i; treemap ceilingKey, floorKey;

Time complexity O(nlgn), Space complexity O(n). n is the length of the array.

class Solution {
    public int oddEvenJumps(int[] A) {
        int n = A.length;
        TreeMap<Integer, Integer> treemap = new TreeMap<>();
        treemap.put(A[n - 1], n - 1);
        int res = 1;
        boolean[][] dp = new boolean[n][2];
        dp[n - 1][0] = true;
        dp[n - 1][1] = true;
        for(int i = n - 2; i >= 0; i--) {
            // odd step; 上升jump；
            Integer nextGreater = treemap.ceilingKey(A[i]);
            if(nextGreater != null) {
                dp[i][0] = dp[treemap.get(nextGreater)][1];
            }
            
            // even step;下降jump；
            Integer nextSmaller = treemap.floorKey(A[i]);
            if(nextSmaller != null) {
                dp[i][1] = dp[treemap.get(nextSmaller)][0];
            }
            treemap.put(A[i], i);
            res += dp[i][0] ? 1 : 0;
        }
        return res;
    }
}