#205 Interval Minimum Number

题目描述：

Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers [start, end]. For each query, calculate the minimum number between index start and end in the given array, return the result list.

 Notice

We suggest you finish problem Segment Tree Build, Segment Tree Query and Segment Tree Modify first.

Have you met this question in a real interview? 

Yes

Example

For array [1,2,7,8,5], and queries [(1,2),(0,4),(2,4)], return[2,1,5]

Challenge 

O(logN) time for each query

题目思路：

这题和#206简直一毛一样，就不多说了。

Mycode（AC = 534ms）：

/**
 * Definition of Interval:
 * classs Interval {
 *     int start, end;
 *     Interval(int start, int end) {
 *         this->start = start;
 *         this->end = end;
 *     }
 */
class SegmentTree {
public:
    SegmentTree *left, *right;
    int start, end, min_num;
    SegmentTree(int start, int end, int min_num) {
        this->start = start;
        this->end = end;
        this->min_num = min_num;
        this->left = NULL;
        this->right = NULL;
    }
};

class Solution { 
public:
    /**
     *@param A, queries: Given an integer array and an query list
     *@return: The result list
     */
    SegmentTree *buildSegmentTree(int start, int end) {
        if (start > end) {
            return NULL;
        }
        else if (start == end) {
            return new SegmentTree(start, end, INT_MAX);
        }
        else {
            SegmentTree *root = new SegmentTree(start, end, INT_MAX);
            root->left = buildSegmentTree(start, (start + end) / 2);
            root->right = buildSegmentTree((start + end) / 2 + 1, end);
            
            return root;
        }
    }
    
    void modifySegmentTree(SegmentTree* root, vector<int> &A) {
        if (root == NULL) {
            return;
        }
        else if (root->start == root->end) {
            root->min_num = A[root->start];
        }
        else {
            modifySegmentTree(root->left, A);
            modifySegmentTree(root->right, A);
            
            root->min_num = min(root->left->min_num, root->right->min_num);
        }
    }
    
    int querySegmentTree(SegmentTree* root, int start, int end) {
        if (root == NULL || start > end) {
            return INT_MAX;
        }
        else if (root->start == start && root->end == end) {
            return root->min_num;
        }
        else {
            int left = querySegmentTree(root->left,
                                        max(start, root->left->start),
                                        min(end, root->left->end));
            int right = querySegmentTree(root->right,
                                        max(start, root->right->start),
                                        min(end, root->right->end));
            return min(left, right);
        }
    }
    
    vector<int> intervalMinNumber(vector<int> &A, vector<Interval> &queries) {
        // write your code here
        vector<int> ans;
        if (queries.size() == 0) return ans;
        
        ans.resize(queries.size());
        SegmentTree *root = buildSegmentTree(0, A.size() - 1);
        modifySegmentTree(root, A);
        
        for (int i = 0; i < queries.size(); i++) {
            ans[i] = querySegmentTree(root, queries[i].start, queries[i].end);
        }
        
        return ans;
    }
};