package leetcode;

/**
 * https://leetcode.com/problems/2-keys-keyboard/
 */
public class Problem650 {
    public int minSteps(int n) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem650 prob = new Problem650();
        System.out.println(prob.minSteps(3)); // 3
    }
}

@@ -141,32 +141,330 @@
     
-// TODO%0A        return 0
+return minSteps(1, n, 1);%0A    %7D%0A%0A    private static int minSteps(int n, int m, int x) %7B%0A        if (n == m) %7B%0A            return 1;%0A        %7D else if (n %3E m) %7B%0A            return 0;%0A        %7D%0A        int a = minSteps(n - x, m, x) + 1;%0A        int b = minSteps(n, m, n);%0A        int min = Math.min(a, b);%0A        return min
 ;%0A  

Update problem 650