LeetCode知识点总结 - 501

LeetCode 501. Find Mode in Binary Search Tree

考点	难度
Tree	Easy

题目

Given the root of a binary search tree (BST) with duplicates, return all the mode(s) (i.e., the most frequently occurred element) in it.

If the tree has more than one mode, return them in any order.

Assume a BST is defined as follows:

The left subtree of a node contains only nodes with keys less than or equal to the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.

思路

inorder按从小到大的顺序把tree里的数字排序。所以先设定cnt为0，如果后一个数字和前一个数字一样cnt+1，如果cnt大于max，把max改为cnt，ans也改成对应的数字。

答案

class Solution {
    Integer pre;
    int max = Integer.MIN_VALUE;
    int cnt = 0;

    public int[] findMode(TreeNode root) {
        List<Integer> ans = new ArrayList<>();
        inorder(root, ans);

        int[] res = new int[ans.size()];
        for (int i = 0; i < ans.size(); i++) res[i] = ans.get(i);
        return res;
    }

    public void inorder(TreeNode root, List<Integer> ans) {
        if (root == null) return;
        inorder(root.left, ans);

        if (pre == null || root.val != pre) cnt = 1;
        else if (pre == null || root.val == pre) cnt++;
        pre = root.val;
        if (cnt > max) {
            ans.clear();
            ans.add(pre);
            max = cnt;
        }
        else if (cnt == max){
            ans.add(pre);
        }
        inorder(root.right, ans);
    }
}