Java max dist btw cuts
Just find max distance btw edges or each cuts horizontally and vertically.\n\n\tpublic int maxArea(int h, int w, int[] hc, int[] vc) {\n        return (int) ((g
Just find max distance btw edges or each cuts horizontally and vertically.\n```\n\tpublic int maxArea(int h, int w, int[] hc, int[] vc) {\n        return (int) ((getMaxDist(h, hc) * getMaxDist(w, vc)) % (Math.pow(10, 9) + 7));\n    }\n    \n    private long getMaxDist(int end, int[] cuts) {\n        Arrays.sort(cuts);\n        long res = 0, from = 0;\n        for (int c : cuts) {\n            res = Math.max(res, c - from);\n            from = c;\n        }\n        return Math.max(res, end - from);\n    }\n```
[]