LeetCode-501. Find Mode in Binary Search Tree [C++][Java]

LeetCode-501. Find Mode in Binary Search Treehttps://leetcode.com/problems/find-mode-in-binary-search-tree/

题目描述

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.

Example 1:

Input: root = [1,null,2,2]
Output: [2]

Example 2:

Input: root = [0]
Output: [0]

Constraints:

• The number of nodes in the tree is in the range [1, 104].
• -105 <= Node.val <= 105

Follow up: Could you do that without using any extra space? (Assume that the implicit stack space incurred due to recursion does not count). 

解题思路

【C++】

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> findMode(TreeNode* root) {
        vector<int> maxCntNums;
        int curCnt = 1, maxCnt = 1;
        TreeNode* preNode = nullptr;
        inOrder(root, maxCntNums, preNode, curCnt, maxCnt);
        return maxCntNums;
    }

    void inOrder(TreeNode* node, vector<int>& nums, TreeNode* &preNode, int& curCnt, int& maxCnt) {
        if(!node) return;
        inOrder(node->left, nums, preNode, curCnt, maxCnt);
        if(preNode) {
            if(preNode->val == node->val) curCnt++;
            else curCnt = 1;
        }
        if(curCnt > maxCnt) {
            maxCnt = curCnt;
            nums.clear();
            nums.push_back(node->val);
        } else if(curCnt == maxCnt) nums.push_back(node->val);
        preNode = node;
        inOrder(node->right, nums, preNode, curCnt, maxCnt);
    }
};

【Java】

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private int curCnt = 1;
    private int maxCnt = 1;
    private TreeNode preNode = null;

    public int[] findMode(TreeNode root) {
        List<Integer> maxCntNums = new ArrayList<>();
        inOrder(root, maxCntNums);
        int[] ret = new int[maxCntNums.size()];
        int idx = 0;
        for (int num : maxCntNums) {
            ret[idx++] = num;
        }
        return ret;
    }

    private void inOrder(TreeNode node, List<Integer> nums) {
        if (node == null) return;
        inOrder(node.left, nums);
        if (preNode != null) {
            if (preNode.val == node.val) curCnt++;
            else curCnt = 1;
        }
        if (curCnt > maxCnt) {
            maxCnt = curCnt;
            nums.clear();
            nums.add(node.val);
        } else if (curCnt == maxCnt) {
            nums.add(node.val);
        }
        preNode = node;
        inOrder(node.right, nums);
    }
}