@@ -0,0 +1,465 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/patching-array/%0A */%0Apublic class Problem330 %7B%0A    public int minPatches(int%5B%5D nums, int n) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem330 prob = new Problem330();%0A        System.out.println(prob.minPatches(new int%5B%5D%7B1, 3%7D, 6)); // 1%0A        prob.minPatches(new int%5B%5D%7B1, 5, 10%7D, 20); // 2%0A        prob.minPatches(new int%5B%5D%7B1, 2, 2%7D, 5); // 0%0A    %7D%0A%7D%0A

Create a skeleton for problem 330