IWANABETHATGUY
IWANABETHATGUY
干脆一块改造了 ```javascript var b = 10; console.log(b); (function b() { var b = 20; console.log(b); })(); ```
```javascript let num1 = [2, 3, 3, 1, 2]; let num2 = [1, 2, 2]; let cp1 = num1.slice(); let cp2 = num2.slice(); cp1.sort((a, b) => a - b); cp2.sort((a,...
既然用到了sort就不用set去重了,双reduce搞定 ```javascript const arrange = arr => { return arr .sort((a, b) => a - b) .reduce( (acc, cur) => (acc[acc.length - 1] === cur ? acc : acc.concat([cur])), [],...
> Any plan to support **code fix**/**code suggestion** like eslint?
> @IWANABETHATGUY lints will not have any formatting checks > > [#3888 (comment)](https://github.com/swc-project/swc/pull/3888#issuecomment-1061515898) Nope, **code fix** not equals to formatting checks.
> @IWANABETHATGUY lints will not have any formatting checks > > [#3888 (comment)](https://github.com/swc-project/swc/pull/3888#issuecomment-1061515898) But thanks for explaining.
I mean something like this. 
这里时间复杂度是错的, merge 这里需要执行 `n - 1` 次, 每一次时间复杂都是 `x + y` , `n`是二维数组第一维的长度, `x` 和 `y` 是 两个合并时两个数组的长度, 总的时间复杂度应该时 `O(n * (x + y)`
```js function genPromise(flag) { return new Promise((resolve, reject) => { if (flag) { resolve(flag); } else { reject(new Error(flag)); } }); } Promise.allSettled([genPromise(true), genPromise(false)]) .then((res) => { console.log(res); }) .catch((err)...
> Could you share some example that you tried to use and that fired that error? Because in markdown we have lists. ~~~ declare_rule! { /// When expressing array types,...