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

    1. Title
    496. Next Greater Element I
    2. Http address
    https://leetcode.com/problems/next-greater-element-i/?tab=Description
    3. The question
     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:

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

    public class Solution {
        public int[] nextGreaterElement(int[] findNums, int[] nums) {
            
            if (findNums == null || findNums.length <= 0) {
                return new int[0];
            }
            int len = findNums.length;
            int[] reArray = new int[len];
    
            Map<Integer, Integer> locMap = new HashMap<Integer, Integer>();
            int numsLen = nums.length;
            for (int i = 0; i < numsLen; i++) {
                locMap.put(nums[i], i);
            }
    
            for (int i = 0; i < len; i++) {
                int loc = locMap.get(findNums[i]);
                int j = loc;
    
                for (j = loc; j < numsLen; j++) {
                    if (nums[j] > findNums[i]) {
                        reArray[i] = nums[j];
                        break;
                    }
                }
                if (j >= numsLen)
                    reArray[i] = -1;
            }
            return reArray;
        
        }
    }
  • 相关阅读:
    Oracle 表空间查询
    FlaskAppBuilder 中文文档 markdown格式
    Springboot + Stomp + React 实现通过前后端通信
    Jmeter自动生成UUID
    Jmeter响应断言中,中文匹配失败问题解决
    IOS使用纯代码布局替换掉默认的storyboard
    MySQL在Windows上创建服务和删除服务
    IOS15上纯代码布局之导航控制器的导航条为透明的问题
    PHP编译FTP扩展
    ansible处理一些逻辑请求思路
  • 原文地址:https://www.cnblogs.com/ordili/p/6516679.html
Copyright © 2011-2022 走看看