寂寞清仓 2022-05-04 13:56:41
class LazyManClass { constructor(name) { console.log(`Hi I am ${name}`) setTimeout(async () => { for (const fn of this.task) { console.log(await fn()) } }) } task = [] timeOut(time, isFirst = false) { this.task[isFirst ? 'unshift' : "push"]( async () => new Promise(r => setTimeout(() => r(`等待了${time}秒...`), time) ) ) return this } sleep(time) { return this.timeOut(time) } sleepFirst(time) { return this.timeOut(time, true) } eat(food) { this.task.push(async () => Promise.resolve(`I am eating ${food}`)) return this } } const LazyMan = (name) => new LazyManClass(name) LazyMan('Tony').eat('lunch').eat('dinner').sleepFirst(5).sleep(10).eat('junk food');
寂寞清仓 2022-05-04 13:55:47
先合并两个有序数组
var mergetTwoArrays = (nums1, nums2) =>{ var i = 0 var m = 0, lenM = nums1.length var n = 0, lenN = nums2.length var arr = [] while(m < lenM && n < lenN) { if (nums1[m] <= nums2[n]) { arr[i++] = nums1[m++] } else { arr[i++] = nums2[n++] } } while(n < lenN) { arr[i++] = nums2[n++] } while(m < lenM) { arr[i++] = nums1[m++] } return arr }
然后求中位数,但是时间复杂度为O(m + n)
寂寞清仓 2022-05-04 13:54:33
Number(100000000000).toLocaleString('de-DE')
- 共 1 页
- 1
https://datatracker.ietf.org/doc/html/rfc7540. RFC的这一节有讲你说的问题。
第 15 题:简单讲解一下 http2 的多路复用