JavaScript如何用递归绘制嵌套三角形?答:function triangle(a, b, c) { points.push(a, b, c);} function divideTriangle(a, b, c, count) { if (count === 0) { triangle(a, b, c);} else { var ab = mix(a, b, 0.5);var ac = mix(a, c, 0.5);var bc = mix(b, c, 0.5);--count;divideTriangle(a...
JS递归函数求[1,[2],[3,[4]]] 返回值为[1,2,3,4]答:var yugi = function(arr, result) { for(var i=0;i<arr.length;i++){ var tmp = arr[i]; if(tmp.join){ yugi(tmp, result); }else{ result.push(tmp); } }}var result = [];yugi([1, [2], [3, [4]]], result);console.log(result);