Next Greater Element I
来源:互联网 发布:ps4白金神作 知乎 编辑:程序博客网 时间:2024/05/16 18:35
1.问题描述
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.
2. 代码
public static int[] nextGreaterElementFast(int[] findNums, int[] nums) { Map<Integer, Integer> map = new HashMap<>(); Stack<Integer> stack = new Stack<>(); for (int num : nums) { while (!stack.isEmpty() && stack.peek() < num){ map.put(stack.pop(), num); } stack.push(num); } System.out.println(map.toString()); for (int i = 0; i < findNums.length; i++) findNums[i] = map.getOrDefault(findNums[i], -1); return findNums; }
3.
这个题收获很多,很好的运用了栈的数据结构,先找出每个元素下一个比他大的元素放入map中
阅读全文
0 0
- 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
- [LeetCode] Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- LeetCode:Next Greater Element I
- 【leetcode】Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- node.js路由控制
- RecycleView+ViewDataBinding+BaseAdapter
- 向下-Div随鼠标拖动改变高度
- python从入门到入坟 四(吕万友)
- excel前端导出(bootstrap-table,tableExport)
- Next Greater Element I
- hql 语句:关联查询left join 和count连用
- Android ScrollView去掉滚动条及ScrollView属性
- JEECG t:autocomplete 自动补全, 生成自己需要展示格式
- git 小结
- RESTful API的理解
- 设置了JOB,但是 不执行
- Linux下的Watchdog驱动
- 使用Prometheus+Grafana 监控MySQL/MONGODB