leetcode刷题计划Day19

最新推荐文章于 2024-06-03 18:24:49 发布

_wrenGhost_

最新推荐文章于 2024-06-03 18:24:49 发布

阅读量170

点赞数

分类专栏： Leetcode 算法刷题文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/wREN_GHOST/article/details/124395422

版权

Leetcode 算法刷题专栏收录该内容

28 篇文章 0 订阅

订阅专栏

169. 多数元素【简单】

https://leetcode-cn.com/problems/majority-element/

class Solution {
    private Map<Integer, Integer> countNums(int[] nums) {
        Map<Integer, Integer> counts = new HashMap<Integer, Integer>();
        for (int num : nums) {
            if (!counts.containsKey(num)) {
                counts.put(num, 1);
            } else {
                counts.put(num, counts.get(num) + 1);
            }
        }
        return counts;
    }

    public int majorityElement(int[] nums) {
        Map<Integer, Integer> counts = countNums(nums);

        Map.Entry<Integer, Integer> majorityEntry = null;
        for (Map.Entry<Integer, Integer> entry : counts.entrySet()) {
            if (majorityEntry == null || entry.getValue() > majorityEntry.getValue()) {
                majorityEntry = entry;
            }
        }

        return majorityEntry.getKey();
    }
}

226. 翻转二叉树【简单】

https://leetcode-cn.com/problems/invert-binary-tree/

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root == null || (root.left == null && root.right == null))
            return root;
        TreeNode left = invertTree(root.left);
        TreeNode right = invertTree(root.right);
        root.left = right;
        root.right = left;
        return root;
    }
}