LeetCode496. Next Greater Element I
来源:互联网 发布:jsp和javascript的用途 编辑:程序博客网 时间:2024/05/22 00:44
LeetCode496. 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:
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.
解题过程:
首先由于nums1是nums2的子集(而且不重复),所以我们可以给nums2写一个类似next数组的算法,就是用map去存储这个数的下一个比它大的数,
即map[i] = j; i是该数,j是下面比该数大的数,然后用栈去模拟计算的过程。
代码如下:
class Solution {public:vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) {stack<int> sta;map<int, int> mmap;vector<int> result;for (int i : nums) {while (!sta.empty() && sta.top() < i) {mmap[sta.top()] = i;sta.pop();}sta.push(i);}for (auto i : findNums) {if (mmap.count(i)) {result.push_back(mmap[i]);}else result.push_back(-1);}return result;}};
阅读全文
0 0
- leetcode496. Next Greater Element I
- Leetcode496. Next Greater Element I
- LeetCode496. Next Greater Element I
- python--leetcode496. Next Greater Element I
- 23.leetCode496:Next Greater Element I
- leetcode496 Next Greater Element JAVA
- LeetCode496. Next Greater Element I使用map解答
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- LEETCODE--Next Greater Element I
- 9-6快速排序
- linux服务器日常常用监控命令以及指标瓶颈
- 英文学习
- JavaScriptCore使用
- Java学习笔记-枚举
- LeetCode496. Next Greater Element I
- JAVA中SSH三大框架整合的详细步骤_摘录于尚硅谷视频
- TabLayout的使用
- linux echo
- mybatis 查询 resultMap="" 只返回一条数据
- easyui 单元格合并
- 企业网站建设改版的未来方向
- 矩阵初始化的缺陷
- c++ 运行出现0x0000007 错误解决总结