weirong111

尾递归优化，一行代码解决 ```js function process(cur, total = 0) { return cur === 0 ? total : process(cur - 1, total + cur); } ```

```js class math { constructor(initValue = 0) { this.value = initValue; } add(...args) { this.value = args.reduce((pre, cur) => pre + cur, this.value); return this; } minus(...args) { this.value =...

``` function promiseUtil(promise) { return Promise.race([ promise, new Promise((_, reject) => { setTimeout(() => { reject("error"); }, 1000); }), ]); } ```

``` function repeat(fn, timer, wait) { return function callback(...args) { setTimeout(() => { fn(...args); timer--; if (timer > 0) callback(...args); }, wait); }; } ```

```js Document h1 { display: block; } 我是一张缺省图 var oBox = document.getElementById("box"); var oH = document.querySelector("h1"); function loadImageAsync(url) { return new Promise(function (resolve, reject) { var image = new Image();...

```js function getDuicheng() { const res = []; for (let i = 1; i < 10; i++) { res.push(i); res.push(i * 11); for (let j = 0; j < 10;...

``` Promise.prototype.myfinally = function (cb) { return this.then( async (data) => { await Promise.resolve(cb(data)); return data; }, async (err) => { await Promise.resolve(cb(err)); throw err; } ); }; const pro...

```js function yasuoString(str) { if (str.length === 0 || str.length === 1) return str; let cur = str[0]; let count = 1; let res = ""; for (let i =...

```ts function extendsString(str: string): string { let num = 0; let cur = ""; let res = ""; for (let i = 0; i < str.length; i++) { if (!isNaN(Number(str[i])))...