Commit 6de0c08

authored

Merge pull request youngyangyang04#1658 from zhicheng-lee/zhicheng-lee-patch-14

更新 0496.下一个更大元素I.md Java代码

2 parents cd75087 + 8fad926 commit 6de0c08Copy full SHA for 6de0c08

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -221,6 +221,32 @@ class Solution {`
`221`	`221`	`return res;`
`222`	`222`	`}`
`223`	`223`	`}`
	`224`	`+`
	`225`	`+// 版本2`
	`226`	`+class Solution {`
	`227`	`+ public int[] nextGreaterElement(int[] nums1, int[] nums2) {`
	`228`	`+ HashMap<Integer, Integer> map = new HashMap<>();`
	`229`	`+ for (int i = 0; i < nums1.length; i++) {`
	`230`	`+ map.put(nums1[i], i);`
	`231`	`+ }`
	`232`	`+`
	`233`	`+ int[] res = new int[nums1.length];`
	`234`	`+ Stack<Integer> stack = new Stack<>();`
	`235`	`+ Arrays.fill(res, -1);`
	`236`	`+`
	`237`	`+ for (int i = 0; i < nums2.length; i++) {`
	`238`	`+ while (!stack.isEmpty() && nums2[stack.peek()] < nums2[i]) {`
	`239`	`+ int pre = nums2[stack.pop()];`
	`240`	`+ if (map.containsKey(pre)) {`
	`241`	`+ res[map.get(pre)] = nums2[i];`
	`242`	`+ }`
	`243`	`+ }`
	`244`	`+ stack.push(i);`
	`245`	`+ }`
	`246`	`+`
	`247`	`+ return res;`
	`248`	`+ }`
	`249`	`+}`
`224`	`250`	```
`225`	`251`	`Python3:`
`226`	`252`	```python

Comments

(0)