牛小扭

分类

题解(27)

/ 注册

全部文章（共4篇）

题解 | #斐波那契数列#

function fibonacci(n) { const dp = [0,1] for(let i=2;i<=n;i++){ dp[i] = dp[i-1] + dp[i-2] } return dp[n] }

HTML/CSS/JavaScript

2022-04-18

0 0

题解 | #判断版本#

<!DOCTYPE html> <html> <head> <meta charset=utf-8> </head> <body> <script typ...

HTML/CSS/JavaScript

2022-04-13

0 0

题解 | #数组去重#

<!DOCTYPE html> <html> <head> <meta charset=utf-8> </head> <body> <script typ...

HTML/CSS/JavaScript

2022-04-10

0 0

题解 | #阶乘#

function _factorial(number) { // 补全代码 if(number <= 1){ return 1 }else{ return number * _factorial(n-1) } }

HTML/CSS/JavaScript

2022-04-08

1 0