Commit15582ef

authored

Merge pull requestyoungyangyang04#453 from daniel1n/patch-2

Update 0501.二叉搜索树中的众数.md

2 parents0f38eb9 +383c9cb commit15582efCopy full SHA for 15582ef

File tree

+34

-0

lines changed

+34

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -345,6 +345,40 @@ public:`
`345`	`345`
`346`	`346`	`Java：`
`347`	`347`
	`348`	`+暴力法`
	`349`	+```java
	`350`	`+classSolution {`
	`351`	`+public int[] findMode(FindModeInBinarySearchTree.TreeNode root) {`
	`352`	`+Map<Integer, Integer> map = new HashMap<>();`
	`353`	`+List<Integer> list = new ArrayList<>();`
	`354`	`+if (root == null) return list.stream().mapToInt(Integer::intValue).toArray();`
	`355`	`+// 获得频率 Map`
	`356`	`+searchBST(root, map);`
	`357`	`+List<Map.Entry<Integer, Integer>> mapList = map.entrySet().stream()`
	`358`	`+.sorted((c1, c2) -> c2.getValue().compareTo(c1.getValue()))`
	`359`	`+.collect(Collectors.toList());`
	`360`	`+list.add(mapList.get(0).getKey());`
	`361`	`+// 把频率最高的加入 list`
	`362`	`+for (int i = 1; i < mapList.size(); i++) {`
	`363`	`+if (mapList.get(i).getValue() == mapList.get(i - 1).getValue()) {`
	`364`	`+list.add(mapList.get(i).getKey());`
	`365`	`+} else {`
	`366`	`+break;`
	`367`	`+}`
	`368`	`+}`
	`369`	`+return list.stream().mapToInt(Integer::intValue).toArray();`
	`370`	`+}`
	`371`	`+`
	`372`	`+void searchBST(FindModeInBinarySearchTree.TreeNode curr, Map<Integer, Integer> map) {`
	`373`	`+if (curr == null) return;`
	`374`	`+map.put(curr.val, map.getOrDefault(curr.val, 0) + 1);`
	`375`	`+searchBST(curr.left, map);`
	`376`	`+searchBST(curr.right, map);`
	`377`	`+}`
	`378`	`+`
	`379`	`+}`
	`380`	+```
	`381`	`+`
`348`	`382`	```Java
`349`	`383`	`classSolution {`
`350`	`384`	`ArrayList<Integer> resList;`

Comments

(0)