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 };
  • 相关阅读:
    参数是指针,传递指针变量,最后函数总分配的内存丢了
    GoDaddy域名注册/空间购买优惠码
    Godaddy主机新建网站说明
    Godaddy主机购买图解教程
    Godaddy 如何添加独立IP到主机账户
    GoDaddy域名注册图解
    Godaddy windows主机添加域名,删除域名,添加子域名 操作说明
    ASP.net与PHP两大网站开发架构优势对比
    Godaddy如何导入导出MSSQL数据库
    什么是DSN文件
  • 原文地址:https://www.cnblogs.com/anghostcici/p/6887007.html
Copyright © 2011-2022 走看看