1206. Next Greater Element I

最新推荐文章于 2025-06-21 00:25:48 发布

原创最新推荐文章于 2025-06-21 00:25:48 发布 · 260 阅读

0 ·

CC 4.0 BY-SA版权

刷题专栏收录该内容

215 篇文章

订阅专栏

本文介绍了一个算法问题：给定两个不包含重复元素的数组nums1和nums2，其中nums1的元素是nums2的子集。任务是找到nums1中每个元素在nums2中对应位置的下一个更大的数。如果不存在，则输出-1。通过遍历的方式解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

描述
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.

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

您在真实的面试中是否遇到过这个题？  是

样例
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.

题目难度不大，逐个遍历即可。

class Solution {
public:
    /**
     * @param nums1: an array
     * @param nums2: an array
     * @return:  find all the next greater numbers for nums1's elements in the corresponding places of nums2
     */
    vector<int> nextGreaterElement(vector<int> &nums1, vector<int> &nums2) {
        // Write your code here
        for(int i=0;i<nums1.size();i++){
            int j=0;
            for(;j<nums2.size();j++){
                if(nums1[i]==nums2[j]) break;
            }
            for(;j<=nums2.size();j++){
                if(j==nums2.size()){
                    nums1[i]=-1;
                    break;
                }
                if(nums1[i]<nums2[j]) {
                    nums1[i]=nums2[j];
                    break;
                }
            }
        }
        return nums1;
    }
};