zoukankan      html  css  js  c++  java
  • [LeetCode] 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.

    首先利用map记录nums中元素及其对应的索引,方便查找。接着在遍历findNums中的元素,根据其在map中相应元素的位置查找下一个较大的数。最后如果找到符合要求的数,跳出循环,将这个数字替换res中对应位置的-1。

    class Solution {
    public:
        vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) {
            vector<int> res(findNums.size(), -1);
            unordered_map<int, int> m;
            for (int i = 0; i != nums.size(); i++)
                m[nums[i]] = i;
            for (int i = 0; i != findNums.size(); i++) {
                int start = m[findNums[i]];
                for (int j = start + 1; j != nums.size(); j++) 
                    if (nums[j] > findNums[i]) {
                        res[i] = nums[j];
                        break;
                    }
            }
            return res;
        }
    };
    // 9 ms
  • 相关阅读:
    个人亲历运维面试
    《Kubernetes进阶实战》之管理Pod资源对象
    Docker容器必备技能 -- iptables
    vue后台管理权限正确思路
    Axios 各种请求方式传递参数格式
    Cookie的使用(js-cookie插件)
    微信小程序template模板与component组件的区别和使用
    如何机智地回答浏览器兼容性问题
    webpack系列5:源码流程,webpack编译流程
    webpack系列4:文件分析.
  • 原文地址:https://www.cnblogs.com/immjc/p/7144920.html
Copyright © 2011-2022 走看看