LeetCode: 496 Next Greater Element I(easy)
2024-09-07 23:32:25
题目：
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
nums1andnums2are unique. - The length of both
nums1andnums2would not exceed 1000.
代码：
自己的：
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) {
vector<int> result;
int s1 = findNums.size();
int s2 = nums.size();
bool b = ;
for (int i=; i<s1; i++){
int tem = -;
for (int j=; j <s2; j++){
if (findNums[i] == nums[j]){
for (int k=j; k<s2; k++){
if (nums[k]>findNums[i]){
tem = nums[k];
break;
}
}
}
}
result.push_back(tem);
}
return result;
}
};
别人的：
class Solution {
public:
vector<int> nextGreaterElement(vector<int>& findNums, vector<int>& nums) {
stack<int> s;
unordered_map<int,int> hash;
for(int i=;i<nums.size();i++){
if(s.empty()){
s.push(nums[i]);
}
else if(nums[i] > s.top()){
while(!s.empty() && s.top()<nums[i]){
hash[s.top()] = nums[i];
s.pop();
}
s.push(nums[i]);
}
else s.push(nums[i]);
}
while(!s.empty()){
hash[s.top()] = -;
s.pop();
}
vector<int> res;
for(int i=;i<findNums.size();i++){
res.push_back(hash[findNums[i]]);
}
return res;
}
};
unordered_map类是c++11标准的内容，具体介绍见链接：https://msdn.microsoft.com/zh-cn/library/bb982522.aspx
最新文章
- iphone 群发短信 闪退 彻底解决
- Longest Substring Without Repeating Characters (c#)
- joomla3.1安装不通过Magic Quotes GPC解决方法
- java正则表达式常用实例——借鉴思路
- 剑指offer--面试题17
- iOS开发--浅谈CocoaAsyncSocket编程
- printf格式输出总结
- linux core dump学习
- 转：Web安全与Rational AppScan入门
- 关于int main( int argc, char *argv[] )
- SQL Server 查询某个字段值在哪张表的哪个字段
- sql 语句按字段指定值排序及分页
- 10 个 MySQL 经典错误【转】
- IdentityServer4 错误解决方案
- JavaScript对象编程-第3章
- string和list互转
- ASP.net 网站开发知识点总结
- es6(14)--iterator for ...of循环
- val和var和Java
- 事务ACID特性