zoukankan      html  css  js  c++  java
  • 496. Next Greater Element I

    You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums2

    The Next Greater Number of a number x in nums1 is the first greater number to its right in nums2. If it does not exist, output -1 for this number.

    Example 1:

    Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
    Output: [-1,3,-1]
    Explanation:
        For number 4 in the first array, you cannot find the next greater number for it in the second array, so output -1.
        For number 1 in the first array, the next greater number for it in the second array is 3.
        For number 2 in the first array, there is no next greater number for it in the second array, so output -1.
    

     Example 2:

    Input: nums1 = [2,4], nums2 = [1,2,3,4].
    Output: [3,-1]
    Explanation:
        For number 2 in the first array, the next greater number for it in the second array is 3.
        For number 4 in the first array, there is no next greater number for it in the second array, so output -1.

    Note:

    1. All elements in nums1 and nums2 are unique.
    2. The length of both nums1 and nums2 would not exceed 1000.

    Solution: use stack to store the numbers haven't found the next greater number, if the top of the stack < the current num, store the pair in the map, pop the stack,then push the current number in the stack.

     1 class Solution {
     2 public:
     3     vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) {
     4         vector<int> res;
     5         unordered_map<int,int> m;
     6         stack<int> st;
     7         for (int num:nums){
     8             while(!st.empty()&&st.top()<num){
     9                 m[st.top()]=num;
    10                 st.pop();
    11             }
    12             st.push(num);
    13         }
    14         for (int num:findNums){
    15             res.push_back(m.count(num)?m[num]:-1);
    16         }
    17         return res;
    18     }
    19 };
  • 相关阅读:
    静态库中的静态变量连接失败的解决
    (转)Virtual PC 2007虚拟网络设置
    (zt)iPhone Developer注册
    (zt)正则表达式30分钟入门教程
    (zt)Flex SDK 3.2和Flex Builder 3.0.2升级
    (转)完成端口之性能优化
    (摘)法拉利年代型号
    安装windows下的NDS开发环境
    [C#]小问题
    javascript "未结束字符串"
  • 原文地址:https://www.cnblogs.com/anghostcici/p/6887007.html
Copyright © 2011-2022 走看看