DaLei
DaLei
hello，这个例子: ```js function currying(fn, length) { length = length || fn.length; // 注释 1 return function (...args) { // 注释 2 return args.length >= length // 注释 3 ? fn.apply(this,...
```javascript function e(s, t){ let reg = new RegExp(t, 'g'); let tArray = []; let result = []; while((tArray = reg.exec(s)) !== null){ result.push(tArray.index); } return result; } ```
> > 用splice就好了嘛 > > 就不用考虑步数超出数组长度 > > 一行代码解决问题 > > ```js > > function rotateArr(arr, k) { > > return [...arr.splice(k+1), ...arr]; > > } > > ``` >...
> > function f(arr,k){arr.unshift(...arr.splice(-k)); console.log(arr) } > > var rotate = function (nums, k) { > > nums.unshift(...nums.splice(nums.length - k, k)) > > return nums > > }; > >...
> > > ```js > > > function rotateArr(arr, k) { > > > return [...arr.splice(k+1), ...arr]; > > > } > > > ``` > > > > >...
@LiuMengzhou 他的那个方法我也看过，不过有些缺陷 [javascript经典面试题之拷贝](https://mp.weixin.qq.com/s/0HLggBh9SdRZMnimEytyvQ)
> ```js > const array = [2, 0, 1, 4, 0, 0, 0, 5, 7, 8]; > array.sort((fir, sec) => { > return fir === 0; > }) > //...
```javascript function transString (str){ return Array.prototype.reduce.call(str, (acc, cur) => acc + (cur === cur.toUpperCase() ? cur.toLowerCase() : cur.toUpperCase()), ''); } ```
```js function f(arr) { return arr.reduce((acc, curr) => { acc[Math.floor(curr / 10)] = acc[Math.floor(curr / 10)] || []; acc[Math.floor(curr / 10)].push(curr); return acc; }, []) } ```