@@ -0,0 +1,458 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/split-array-largest-sum/%0A */%0Apublic class Problem410 %7B%0A    public int splitArray(int%5B%5D nums, int m) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem410 prob = new Problem410();%0A        System.out.println(prob.splitArray(new int%5B%5D%7B7, 2, 5, 10, 8%7D, 2)); // 18%0A        System.out.println(prob.splitArray(new int%5B%5D%7B7, 2, 5, 10, 8%7D, 3)); // 14%0A    %7D%0A%7D%0A

Update problem 410