maginaCp
maginaCp
```javascript const findTransIdToChildren = (data, id) => { let arr = null const find = (data, idArr = []) => { if (arr) return for (let i = 0; i...
```javascript // 转化为概率计算 // 不考虑key=0 // 分割n 实例 52312 => 50000,52000,52300,52310,52312 // 计算 00000-49999 50000-51999 52000-52299 52300-52309 52310-52312 1 * 0.9 * (长度 - 1) || (首位 - 1) /...
``` function convert (list) { let obj = list.reduce((pre, item) => { pre[item.parentId] = pre[item.parentId] || [] pre[item.parentId].push(item) return pre }, {}) let arr = [] for (let k in...
``` class LazyManClass { tasklist = [] constructor (name) { console.log(`Hi I am ${name}`) setTimeout(() => { this.tasklist.reduce((preState, item) => { return preState.then(item) }, Promise.resolve()) }, 0) } eat (foods)...
``` javascript var changeNumStr = function (str) { var arr = str.split(', '); return (arr.reduce(function (pre, item) { var val = +item; if (pre.last === undefined || pre.last + 1...
```javascript var exchangEntry = function (data) { var obj = {}; for (var k in data) { var arr = k.split('.'); var lastObj = obj; var j = void 0;...
类似归并排序最后一大步的思路，不排序直接找中位数 逐步去除最大最小数，逼近中位数 ```javascript const quickMid = (nums1, nums2) => { let n = Math.ceil((nums2.length + nums1.length) / 2) let i1Start = i2Start = 0 let i1End = nums1.length -1, i2End...
链表没有随机访问的能力，获取第n个元素需要从第一个元素逐步查询 增删改查的时间复杂度是o(n) ```javascript const LinkList = (function () { class _Node { constructor(value) { this.value = value; this.next = null; } } class LinkList { constructor() { this.head = null;...
对象转化为数组格式排序后，再用JSON.stringify处理，解决键名顺序问题 ```javascript const arr1 = [123, "meili", "123", "mogu", 123]; const arr2 = [123, [1, 2, 3], [1, "2", 3], [1, 2, 3], "meili"]; const arr3 = [123, { a:...
```javascript const deepCopy = (data, map = new Map()) => { let result if (map.has(data)) { return map.get(data) } else if (data instanceof Array) { result = [] map.set(data, result)...