美文网首页
#496 Next Greater Element I

#496 Next Greater Element I

作者: 乐正君Krizma | 来源:发表于2017-04-27 22:01 被阅读0次

    题目:

    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 in nums1 is the first greater number to its right in nums2. If it does not exist, output -1 for this number.


    代码:

    var nextGreaterElement  =  function (findNums, nums) {    

    var res = {}, ans = [];   

    for(let i=0;i<nums.length;++i){

    let t = nums[i];

    res[t] = -1;

    for(let j=i+1;j<nums.length;++j){

    if (nums[j] > t) {

    res[t] = nums[j];

    break;

    }

    }

    }

    for(let i=0;i<findNums.length;++i){

    ans[i] = res[findNums[i]];

    }

    return ans;

    };

    相关文章

      网友评论

          本文标题:#496 Next Greater Element I

          本文链接:https://www.haomeiwen.com/subject/gwinzttx.html