LeetCode-496. Next Greater Element I
来源:互联网 发布:淘宝达人账号如何注销 编辑:程序博客网 时间:2024/05/13 17:49
问题:https://leetcode.com/problems/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 and nums2 are unique.
The length of both nums1 and nums2 would not exceed 1000.
简单来说就是两个序列,求一个结果序列,第一个序列是第二个序列的子集且元素都unique,第一个序列的每个元素映射到第二个序列的相同的元素,如果第二个序列当前元素的右边出现比此元素大的元素则更新结果序列,否则更新为-1。
分析:使用栈,从后往前遍历nums[i],每当栈不为空的时候,一直出栈直到遇到比nums[i]大的数字停止。设立一个map
class Solution {public: vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) { map<int,int> save; stack<int> q; vector<int> res; for(int i=nums.size()-1;i>=0;i--){ while(!q.empty() && q.top()<nums[i]){ q.pop(); } save[nums[i]]=q.empty()?-1:q.top(); q.push(nums[i]); } for(int i=0;i<findNums.size();i++){ res.push_back(save[findNums[i]]); } return res; }};
- 【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
- iOS多个网络请求问题
- HDU 1078 FatMouse and Cheese
- #!/usr/bin/env python的作用
- Spring源码学习之AOP
- 运维笔记31 (pacemaker高可用集群搭建的总结)
- LeetCode-496. Next Greater Element I
- Android Material Design -TextInputLayout
- 公众号第三方平台和微信公众号平台的区别与开发步骤
- 程序中乱码解决方案
- 集合各实现类的底层实现原理
- 设置mysql远程链接
- Redis设计思路学习与总结
- Vue2+VueRouter2+webpack 构建项目实战(二)目录以及文件结构
- Win10获取VSS、CVS服务器的代码很慢