青蛙跳台阶问题

1. 求台阶方案总数

	function getTotal(steps) {
		if (steps < 0 || steps === 1) {
			return 1
		}
		if (steps === 2) {
			return 2;
		}
		return getTotal(steps - 1) + getTotal(steps - 2)
	}

2. 列出每种跳台方案

	function steps(target, cur = 0, stepArr=[], res = []) {
	  	if (cur + 1 <= target) {
		    stepArr.push(1)
		    steps(target, cur + 1, stepArr, res)
		    if (cur + 1 === target) {
		      res.push([...stepArr])
		    }
		    stepArr.pop()
	  	}
	  	if (cur + 2 <= target) {
	   		stepArr.push(2)
	    	steps(target, cur + 2, stepArr, res)
		    if (cur + 2 === target) {
		      res.push([...stepArr])
		    }
	    	stepArr.pop()
	  	}
  		return res;
	}