LeetCode——分治

最新推荐文章于 2022-07-27 19:03:24 发布

Lumos`

最新推荐文章于 2022-07-27 19:03:24 发布

阅读量199

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_41910694/article/details/103336522

版权

LeetCode 专栏收录该内容

20 篇文章 2 订阅

订阅专栏

LeetCode类型题之分治

public List<Integer> diffWaysToCompute(String input) {
        List<Integer> ways = new ArrayList<Integer>();
        for (int i = 0; i < input.length(); i++) {
            char c = input.charAt(i);
            if (c == '+' || c == '-' || c == '*') {
                List<Integer> left = diffWaysToCompute(input.substring(0, i));
                List<Integer> right = diffWaysToCompute(input.substring(i + 1));
                for (Integer l : left) {
                    for (Integer r : right) {
                        switch (c) {
                            case '+':
                                ways.add(l + r);
                                break;
                            case '-':
                                ways.add(l - r);
                                break;
                            case '*':
                                ways.add(l * r);
                                break;
                        }
                    }
                }
            }
        }
        if (ways.size() == 0) {
            ways.add(Integer.valueOf(input));
        }
        return ways;
    }

2. 不同的二叉搜索树

在这里插入图片描述

public List<TreeNode> generateTrees(int n) {
        if (n < 1) {
            return new LinkedList<TreeNode>();
        }
        return generateTrees(1, n);
    }

    private List<TreeNode> generateTrees(int s, int e) {
        List<TreeNode> res = new LinkedList<TreeNode>();
        if (s > e) {
            res.add(null);
            return res;
        }
        for (int i = s; i <= e; i++) {
            List<TreeNode> leftSubtrees = generateTrees(s, i - 1);
            List<TreeNode> rightSubtrees = generateTrees(i + 1, e);
            for (TreeNode left : leftSubtrees) {
                for (TreeNode right : rightSubtrees) {
                    TreeNode root = new TreeNode(i);
                    root.left = left;
                    root.right = right;
                    res.add(root);
                }
            }
        }
        return res;
    }