LZ

Results 21 comments of LZ

```js const obj = {1:222, 2:123, 5:888}; const arr = []; for(let i =1; i

```js function f2(number){ const str = number.toString(); if(number < 10){ return number.toString() }else { return str.slice(str.length-1, str.length)+ f2(str.slice(0, str.length-1)); } }

```js var a = { arr: [1,2,3], toString: function() { return this.arr.shift(); } }; ```

```js const arr1 = ['A1', 'A2', 'B1', 'B2', 'C1', 'C2', 'D1', 'D2']; const arr2 = ['A', 'B', 'C', 'D']; const arr = [...arr1, ...arr2]; const newArr = arr.sort((pre, next) =>...

react-hooks时代貌似改写了这种方式,我用react-hooks写法写出来的结果都是0

> 哈希表,时间复杂度O(m + n) m为nums1长度,n为nums2长度 > > ```js > const intersect = (nums1, nums2) => { > const map = {} > const res = [] > for (let n...

```js for (let index in arr){ if(arr[index].charCodeAt() >90){ arr[index] = arr[index].toUpperCase() }else { arr[index] = arr[index].toLowerCase() } } console.log(arr.join(''));

react-hooks时代已经没这个东西了,而且第一个例子用react-hooks写的话,得到的结果都是0,而不是0 0 2 3, ```js import React, {useEffect, useState} from 'react'; const ComponentTwo = () => { const [val, setVal] = useState(0); useEffect(() => { setVal(val+1); console.log(val); setVal(val+1); console.log(val); setVal(val+1);...

不对,我自己试过,如果service-work和强缓存同时存在的话, PC上是service-work为主;但是移动端,是以强缓存为主的,我测试的是service-work采用 StaleWhileRevalidate策略,pc上会随着文件更新而下次更新,但是移动端上,不到强缓存时间,是不理会service-work的

try react-native-draggable-grid this library, it works very well for me