N Steps

package recursion;

public class NSteps {

    static int nSteps(int n, int[] steps) {
        if(n==0)
            return 1;
        if(n<0)
            return 0;

        int result = 0;
        for(int i=0; i < steps.length; i++) {
            result += nSteps(n-steps[i], steps);
        }

        return result;
    }

    public static void main(String s[]) {
        int[] arr = {1,4,5};
        System.out.println(nSteps(6, arr));
    }
}