LeetCode DAY50(739. Daily Temperatures&496. Next Greater Element I)

Preface

This is a new day to start my Monotonic stack journey.
Learn something new and keep reviewing what I learnt before.

1. Daily Temperatures

LeetCode Link: 739. Daily Temperatures

Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.

Example 1:

Input: temperatures = [73,74,75,71,69,72,76,73]
Output: [1,1,4,2,1,1,0,0]
Example 2:

Input: temperatures = [30,40,50,60]
Output: [1,1,1,0]
Example 3:

Input: temperatures = [30,60,90]
Output: [1,1,0]

Constraints:

1 <= temperatures.length <= 10^5
30 <= temperatures[i] <= 100

Analysis and Solution

Monotonic stack

LeetCode C++ as followings Monotonic stack

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& T) {
        // increment stack
        stack<int> st;
        vector<int> result(T.size(), 0);//initialization == 0
        st.push(0);
        for (int i = 1; i < T.size(); i++) {
            if (T[i] < T[st.top()]) {                       // case 1
                st.push(i);
            } else if (T[i] == T[st.top()]) {               // case 2
                st.push(i);
            } else {
                while (!st.empty() && T[i] > T[st.top()]) { // case 3
                    result[st.top()] = i - st.top();
                    st.pop();
                }
                st.push(i);
            }
        }
        return result;
    }
};

2. Next Greater Element I

LeetCode Link: 496. Next Greater Element I

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.

You are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2.

For each 0 <= i < nums1.length, find the index j such that nums1[i] == nums2[j] and determine the next greater element of nums2[j] in nums2. If there is no next greater element, then the answer for this query is -1.

Return an array ans of length nums1.length such that ans[i] is the next greater element as described above.

Example 1:

Input: nums1 = [4,1,2], nums2 = [1,3,4,2]
Output: [-1,3,-1]
Explanation: The next greater element for each value of nums1 is as follows:

• 4 is underlined in nums2 = [1,3,4,2]. There is no next greater element, so the answer is -1.
• 1 is underlined in nums2 = [1,3,4,2]. The next greater element is 3.
• 2 is underlined in nums2 = [1,3,4,2]. There is no next greater element, so the answer is -1.
  Example 2:

Input: nums1 = [2,4], nums2 = [1,2,3,4]
Output: [3,-1]
Explanation: The next greater element for each value of nums1 is as follows:

• 2 is underlined in nums2 = [1,2,3,4]. The next greater element is 3.
• 4 is underlined in nums2 = [1,2,3,4]. There is no next greater element, so the answer is -1.

Constraints:

1 <= nums1.length <= nums2.length <= 1000
0 <= nums1[i], nums2[i] <= 10^4
All integers in nums1 and nums2 are unique.
All the integers of nums1 also appear in nums2.

Follow up: Could you find an O(nums1.length + nums2.length) solution?

Analysis and Solution

Monotonic stack

LeetCode C++ as followings Monotonic stack

class Solution {
public:
    vector<int> nextGreaterElement(vector<int>& nums1, vector<int>& nums2) {
        stack<int> st;
        vector<int> result(nums1.size(), -1);//initialization == -1
        if (nums1.size() == 0) return result;//remove case 0

        unordered_map<int, int> umap; // key:element，value：subscript
        for (int i = 0; i < nums1.size(); i++) {
            umap[nums1[i]] = i;
        }
        st.push(0);
        for (int i = 1; i < nums2.size(); i++) {
            if (nums2[i] < nums2[st.top()]) {           // case 1
                st.push(i);
            } else if (nums2[i] == nums2[st.top()]) {   // case 2
                st.push(i);
            } else {                                    // case 3
                while (!st.empty() && nums2[i] > nums2[st.top()]) {
                    if (umap.count(nums2[st.top()]) > 0) { // See if this element exists in the map
                        int index = umap[nums2[st.top()]]; // Find the subscript of nums2[st.top()] in nums1 according to map
                        result[index] = nums2[i];
                    }
                    st.pop();
                }
                st.push(i);
            }
        }
        return result;
    }
};