#555 · #2940 · Find Building Where Alice and Bob Can Meet(找到 Alice 和 Bob 可以相遇的建筑)

You are given an array heights and queries where queries[i] = [a, b]. For each query, find the leftmost index c such that max(a, b) < c and heights[c] > max(heights[a], heights[b]). If a == b or heights[max(a,b)] > heights[min(a,b)], the answer is max(a, b). Return -1 when no such index exists. Constraints: 1 <= heights.length, queries.length <= 5 * 10^4.