【LeetCode】496. Next Greater Element I
来源:互联网 发布:赛博朋克2077 知乎 编辑:程序博客网 时间:2024/06/14 17:44
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
andnums2
are unique. - The length of both
nums1
andnums2
would not exceed 1000.
/** * @param {number[]} findNums * @param {number[]} nums * @return {number[]} */var nextGreaterElement = function(findNums, nums) { var ret=new Array(); for(var i = 0 ; i < findNums.length;i++){ var index=nums.indexOf(findNums[i]); var count = 1; while((index+count)<nums.length&&nums[index+count]<nums[index]){count++;} if(index+count==nums.length){ ret.push(-1); }else{ ret.push(nums[index+count]) } } return ret;};
很简单的一个题。
阅读全文
0 0
- 【Leetcode】496. Next Greater Element I
- leetcode -- 496. Next Greater Element I 【栈】
- 【LeetCode】496. Next Greater Element I
- LeetCode 496. Next Greater Element I
- LeetCode 496. Next Greater Element I
- leetcode 496. Next Greater Element I
- LeetCode-496. Next Greater Element I
- [LeetCode]496. Next Greater Element I
- LeetCode 496. Next Greater Element I
- LeetCode 496. Next Greater Element I
- LeetCode | 496. Next Greater Element I
- 【LeetCode】496. Next Greater Element I
- 【LeetCode】496. Next Greater Element I
- Leetcode 496. Next Greater Element I
- LeetCode:496. Next Greater Element I
- LeetCode OJ 496. Next Greater Element I
- 【C++】【LeetCode】496. Next Greater Element I
- LeetCode 496. Next Greater Element I
- F
- Lua中返回两个值
- 《http权威指南》知识点摘要
- 适配器模式
- 润乾5填报表定时提交
- 【LeetCode】496. Next Greater Element I
- atom前端向插件
- 软交换之争:OVS VS LINUX BRIDGE
- 整理Ubuntu下secureCRT的安装和USB端口权限问题
- 返回表中的属性值
- Codeforces835A Key races
- Python网络爬虫的网站实例
- java中冒号:的用法
- mysql for mac tar安装