Divide and Conquer

最新推荐文章于 2019-07-07 15:07:00 发布

weixin_30908707

最新推荐文章于 2019-07-07 15:07:00 发布

阅读量108

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/whesuanfa/p/6817014.html

本文介绍了解决天际线问题的算法，利用最大堆实现建筑物轮廓的描绘，并提出了不同方式添加括号计算表达式的解决方案，通过递归枚举所有可能的计算顺序。

2 218 The Skyline Problem 最大堆遍历节点

    public List<int[]> getSkyline(int[][] buildings) {
        List<int[]> res = new ArrayList<>();
        List<int[]> point = new ArrayList<>();
        for (int i = 0; i < buildings.length; i++)
        {
            point.add(new int[]{buildings[i][0], buildings[i][2]});
            point.add(new int[]{buildings[i][1], -buildings[i][2]});
        }
        Collections.sort(point, (a,b)-> {
            if (a[0] != b[0]) return a[0] - b[0];
            return b[1] - a[1];});
        PriorityQueue<Integer> maxheap = new PriorityQueue<>((a,b)->(b - a));
        int cur = 0, pre = 0;
        for (int i = 0; i < point.size(); i++)
        {
            int[] b = point.get(i);
            if (b[1] > 0)
            {
                maxheap.add(b[1]);
                cur = maxheap.peek();
            }
            else
            {
                maxheap.remove(-b[1]);
                cur = maxheap.peek() == null ? 0 : maxheap.peek();
            }
            if (pre != cur)
            {
                res.add(new int[]{b[0], cur});
                pre = cur;
            }
        }
        return res;
    }

View Code

3 241 Different Ways to Add Parentheses 找符号，分开

    public List<Integer> diffWaysToCompute(String input) {
        List<Integer> res = new LinkedList<>();
        for (int i = 0; i < input.length(); i++)
        {
            char c = input.charAt(i);
            if (c == '+' || c == '-' || c == '*')
            {
                String a = input.substring(0, i);
                String b = input.substring(i+1);
                List<Integer> a1 = diffWaysToCompute(a);
                List<Integer> b1 = diffWaysToCompute(b);
                for (int x : a1)
                {
                    for (int y : b1)
                    {
                        if (c == '+')
                        {
                            res.add(x + y);
                        }
                        else if (c == '-')
                        {
                            res.add(x - y);
                        }
                        else if (c == '*')
                        {
                            res.add(x * y);
                        }
                    }
                }
            }
        }
        if (res.size() == 0) res.add(Integer.valueOf(input));
        return res;
    }