Rain120

### Error Result The CI error result is the **nodejs** version must big than 10, you need to pull the master from this repo, more info 👇👇👇  #### Master...

> @Rain120 thanks for catching that. I just merged master branch from the upstream repository. The tests still fail but for totally different reasons, it's simply unfinished work. I saw...

### [React better-scroll实践](https://codesandbox.io/s/react-better-scroll-8gghg) -> 完善后会移到[GitHub](https://github.com/Rain120/better-scroll-for-react-usage)上(计划使用**Typescript**) ### [文档](https://rain120.github.io/study-notes/fe/react/better-scroll/base) 待完善，欢迎**star**    

### 生命周期 https://rain120.github.io/study-notes/fe/javascript/key-concept/var-let-const-function-lifecycle

参考: https://github.com/Rain120/Web-Study/issues/18 ```js var deFlatten = function (entry) { const res = {}; var format = (res, keys, value) => { const key = keys.shift(); if (!keys.length) { res[key] =...

推荐 [docusaurus](https://docusaurus.cn/) ，mdx 可以支持将 react 组件嵌入，也可以写 md，我帮忙建也可以的

The bug is caused by this plugin. It also caused runkit to be disabled 

@Falcikas Jesus，so long to get the idea for the project, srr, I had lost it, I cannot test for it.

```js /** * 利用单调栈寻找左右边界 * 把每个数字都看作是当前区间内的最小值，那么只要区间和的值越大，结果值就越大。 * * 因此我们可以利用（递增）单调栈得到每个元素的左边界和右边界 * （边界的定义即为 左/右边 第一个比该元素更小的值），最后用每个元素乘以每个元素对应的区间和，找出最大值即可。 * * 为了防止每个元素重复计算一段区间和，可以提前计算一个前缀和数组，用于保存某元素之前的各项和（不含该元素）， * 求取一段区间和的时候用右边界的前缀和减去左边界的前缀和即可。 * * 这个方法的优点在于只需要遍历数组一次，大大降低了时间复杂度. * 时间复杂度为：O(2n). 各个元素进出栈各一次。 */ function maxSubRange(arr) { let max...

```js function maxSubRange(arr) { let max = 0; const result = []; while (arr.length) { const num = Math.max(...arr) result.push(...arr.splice(arr.indexOf(num), 1)); const min = Math.min(...result); const sum = result.reduce((res,item) =>...