mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-13 17:09:46 +08:00
build
This commit is contained in:
@@ -2119,7 +2119,7 @@ $$
|
||||
```javascript title="time_complexity.js"
|
||||
/* 指数阶(递归实现) */
|
||||
function expRecur(n) {
|
||||
if (n == 1) return 1;
|
||||
if (n === 1) return 1;
|
||||
return expRecur(n - 1) + expRecur(n - 1) + 1;
|
||||
}
|
||||
```
|
||||
@@ -2129,7 +2129,7 @@ $$
|
||||
```typescript title="time_complexity.ts"
|
||||
/* 指数阶(递归实现) */
|
||||
function expRecur(n: number): number {
|
||||
if (n == 1) return 1;
|
||||
if (n === 1) return 1;
|
||||
return expRecur(n - 1) + expRecur(n - 1) + 1;
|
||||
}
|
||||
```
|
||||
@@ -2781,7 +2781,7 @@ $$
|
||||
```javascript title="time_complexity.js"
|
||||
/* 阶乘阶(递归实现) */
|
||||
function factorialRecur(n) {
|
||||
if (n == 0) return 1;
|
||||
if (n === 0) return 1;
|
||||
let count = 0;
|
||||
// 从 1 个分裂出 n 个
|
||||
for (let i = 0; i < n; i++) {
|
||||
@@ -2796,7 +2796,7 @@ $$
|
||||
```typescript title="time_complexity.ts"
|
||||
/* 阶乘阶(递归实现) */
|
||||
function factorialRecur(n: number): number {
|
||||
if (n == 0) return 1;
|
||||
if (n === 0) return 1;
|
||||
let count = 0;
|
||||
// 从 1 个分裂出 n 个
|
||||
for (let i = 0; i < n; i++) {
|
||||
|
||||
Reference in New Issue
Block a user