jackchenl

```js var b = 10; (function b(){ var b = 20; //or let b = 20; console.log(this.b); console.log(b); })(); ```

``` function findMinNumIndex(arr) { if (!arr || !(arr || []).length) return -1 let min = { index: -1, data: Infinity } arr.forEach((ele, idx) => { if (ele > 0 &&...

递归函数解法： ```js function spreadArr(arr=[]){ if(arr.some(ele=>Array.isArray(ele))){ let newArr = []; arr.forEach((ele) => { if(Array.isArray(ele)){ newArr = newArr.concat(...ele) }else{ if(!newArr.includes(ele)) newArr.push(ele) } }) return spreadArr(newArr); } return arr.sort((a,b)=> a-b); } spreadArr([ [1,...

``` function moveZero(arr){ const len = arr.length; let flag = 0; for(let i=0; i< len - flag; i++){ if(arr[i] == 0){ arr.splice(i,1); arr.push(0); flag++; i--; } } return arr; }...