js Recursive Sum 1, 2, 3, 3, 3, 3, 3, 3, 2, 1?
js Recursive Sum 1, 2, 3, 3, 3, 3, 3, 3, 2, 1?
there are actually all the answers upstairs, but the title requires recursion.
Recursive bar. My understanding is to try to avoid any transformation process and use your brain as little as possible, right?
I will mainly talk about the train of thought of solving this kind of problem. The idea of
recursion is to solve the problem in stages and then determine the end point. The core of
is to find the relationship between fn (n) and fn (nMui 1). Combined with the boundary condition fn (1), write a function as follows:
function fn(n) {
//
if (...) return ...;
//
return fn(n-1) + ...;
}for this question,
fn(n) = 1 + 2 + 3 + ... + n-1 + n + n-1 + ... + 3 + 2 + 1;
fn(n-1) = 1 + 2 + 3 + ... + n-1 + ... + 3 + 2 + 1;so
fn(n) = fn(n-1) + n-1 + n;end point
fn(1) = 1;can be combined to write
.function fn(n) {
if (n==1) return 1; //
return fn(n-1) + n-1 + n; //
}similar ones can be obtained in the same way
define f (n) = sum (1, 2, 3,., n,., 3, 2, 1) .
problem translates into f (n) = 2 * g (n)-n , where g (n) = sum (1,2,3,., n) ). If we do not use Gaussian summation to force recursion, g (n) = g (n-1) + n (n > 1), g (n) = 1 (n = 1).
function g(n) {
if(n > 1) return g(n - 1) + n;
else if(n == 1) return 1;
}
function f(n) {
return 2 * g(n) + n;
} obviously, f (n) = f (n-1) + n + (n-1) (n > 1), f (n) = 1 (n = 1).
function f(n) {
if(n > 1) return f(n - 1) + n + n - 1;
else if(n == 1) return 1;
}var a = 1;
for (var i = 2; i < n; iPP) {
a = a + i
}
var sum = 2*a + n;
console.log(sum) transform 1 n into the sum of the former n terms and n terms.
thus comes
1 + 2 + 3 + 4 +. + n +. + 3 + 2 + 1 = n (n + 1) / 2 + (n-1) (n-1 + 1) / 2
to get n < sup > 2 < / sup >
so:
<br>4<br> indexPP<br>value = 1+2+3+4 <br> return;<br> index--<br>value += 3+2+1+0;<br>var cal = function() {
var index=0;
var value=0;
return function show(n) {
if(n < 0) return;
value += index;
if(index === n)return;
indexPP;
show(n);
index--;
value += index;
return value;
}
};
cal()(4) // 16
work needs to use a js recursive writing, really can not write it, ask for help, you can add Wechat to send a big red packet! The data structure of trustworthiness ~ is as follows: [ { key: 1 , name: name , label: ...
has the following recursive function, which cannot return the correct result: const navItems = [ { name: name1 , label: , items: [ { name: name2 , label: , items:...
as mentioned in the question, I use recursion to calculate the approximate value of PI: PI 4 = 1-1 PI 3 + 1 hand 7 + 1 hand 9 +; code is as follows: let calPI = (n, sum = 1)=> { if(n < 3) return sum*4; n%4 === 1 ? sum += 1 n...
function getTree ($data, $pId) { $tree = ; -------------------1 foreach ($data as $k = > $v) { if ($v [ cate_ParentId ] = = $pId) { Father finds son $v[ cate_ParentId ] = getTree($data, $v[ cate_Id ]); ---------------------2 ...
existing data: var res = [{ code: 1, name: "", children: [{ code: 1, name: "", children: [{ code: 1, name: "", children: [{ code: 1, ...
topic description I store user information in localStorage userInfo, to encapsulate a method to modify userInfo related codes userInfof var userInfo= { id: 123 , name: Jim , info:{ address:{ home: , ...
The Array.prototype.flat () method can flatten the nested array into flattening into one-dimensional array , accept a number as several layers of expansion, and defaults to layer 1 . If you expand no matter how many layers are nested, you can pass...
problem description The parameter is [number, distance] to find out the point coordinates satisfied in the two-bit plane of the browser. number: the number of coordinate points in the two-bit plane of the browser. distance: the distance between ea...