Absolutely Simple Java Recursive Solution

  • 0


    public int integerBreak(int n) {
        int sum=0;
        int carry=0;
        if(n==2) return 1;
        if(n==3) return 2;
        if(n==4) return 4;
        if(n==5) return 6;
        if(n==6) return 9;
        return 3*integerBreak(n-3);



Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.