496. Next Greater Element I
来源:互联网 发布:centos 编辑文件 编辑:程序博客网 时间:2024/06/05 19:39
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.
public class Solution { public int[] nextGreaterElement(int[] findNums, int[] nums) { HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); for (int i = 0; i < nums.length; i ++) { map.put(nums[i], i); } int[] res = new int[findNums.length]; for (int i = 0; i < findNums.length; i ++) { int index = map.get(findNums[i]); int j = 0; for (j = index + 1; j < nums.length; j ++) { if (nums[j] > nums[index]) { res[i] = nums[j]; break; } } if (j == nums.length) { res[i] = -1; } } return res; }}
阅读全文
0 0
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496.Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- 496. Next Greater Element I
- Android系统如何修改默认打开程序
- tinyxml2的简单运用
- PeerConnectionClient分析(一)
- PeerConnectionClient(二)之Win32Socket
- 选择结构
- 496. Next Greater Element I
- peerconnection_client demo总流程(一)
- peerconnection_client demo总流程(二)
- peerconnection_client demo总流程(三)
- NAT的4种类型
- p2p建立连接过程
- ffmpeg之rtmp分析(一)
- P2870 (poj 3617) [USACO07DEC]最佳牛线,黄金Best Cow Line, Gold 可爱的贪心
- rtmp协议整理