leetcode-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:

1
2
3
4
5
6
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:

1
2
3
4
5
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.

分析

nums2 是给定的数组，nums1 是 nums2 的子集，求集合中每个数字在原数组中右边的第一个较大的数字，如果存在，记录其下标，否则记录 -1。

一次遍历即可。

解决方案1(Java)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class Solution {
    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
        int nums1Len = nums1.length;
        int nums2Len = nums2.length;
        int[] result = new int[nums1Len];
    
        int k = 0;
        for (int i = 0; i < nums1Len; i++) {
            for (int j = 0; j < nums2Len; j++) {
                if (nums1[i] == nums2[j]) {
                    for (k = j + 1; k < nums2Len; k++) {
                        if (nums2[k] > nums1[i]) {
                            result[i] = nums2[k];
                            break;
                        }
                    }
                    if (k == nums2Len) {
                        result[i] = -1;
                    }
                    break;
                }
            }
        }
        return result;
    }
}

相关问题

题目来源