Some Component

{props.message}

\n );\n};\n\nconst KeepAliveSomeComponent = withKeepAlive(SomeComponent);\n```\n\n在父组件中使用`KeepAliveSomeComponent`来实现缓存功能：\n\n```jsx\nconst ParentComponent = () => {\n const [showComponent, setShowComponent] = useState(false);\n\n const toggleComponent = () => {\n setShowComponent(!showComponent);\n };\n\n return (\n

\n \n {showComponent && (\n \n )}\n

\n );\n};\n```\n\n在上述示例中，`ParentComponent`包含一个按钮，点击按钮时切换`KeepAliveSomeComponent`的显示与隐藏。每次切换时，`KeepAliveSomeComponent`的状态将保留，因为它被缓存并在需要时重新渲染。\n\n同样地，这个示例只实现了最基本的缓存功能，并没有处理更复杂的场景。如果需要更复杂的缓存功能，可以考虑使用状态管理库来管理组件的状态和缓存。\n",{"_54":426,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/580/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/580/timeline",{"_54":429,"_56":57,"_58":430,"_60":431,"_62":432,"_64":433,"_66":434,"_68":435,"_70":436,"_72":437,"_74":438,"_107":439,"_134":135,"_136":26,"_137":-5,"_138":442,"_140":443,"_162":155,"_156":445,"_158":446,"_161":-5,"_165":166,"_167":447,"_172":-5,"_173":448,"_175":449,"_187":451,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/579","https://api.github.com/repos/pro-collection/interview-question/issues/579/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/579/comments","https://api.github.com/repos/pro-collection/interview-question/issues/579/events","https://github.com/pro-collection/interview-question/issues/579",1920771704,"I_kwDOJGDC6c5yfKZ4",579,"[Vue] 中为何不要把 v-if 和 v-for 同时用在同一个元素上，原理是什么？【热度: 546】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[440,441],{"_66":206,"_68":207,"_54":208,"_113":209,"_115":210,"_117":26,"_118":211},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":444,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-10-01T13:36:04Z","2023-10-01T13:36:05Z",{"_169":155,"_170":155,"_171":155},"**关键词**：v-if和v-for性能\n\n确实，将`v-if`和`v-for`同时用在同一个元素上可能会导致性能问题。**原因在于`v-for`具有比`v-if`更高的优先级，它会在每次渲染的时候都会运行**。这意味着，即使在某些情况下`v-if`的条件为`false`，`v-for`仍然会对数据进行遍历和渲染。\n\n这样会导致一些不必要的性能消耗，特别是当数据量较大时。Vue在渲染时会尽量复用已经存在的元素，而不是重新创建和销毁它们。但是当`v-for`遍历的数据项发生变化时，Vue会使用具有相同`key`的元素，此时`v-if`的条件可能会影响到之前的元素，导致一些不符合预期的行为。\n\n让我们来看一个具体的例子来说明这个问题。\n\n假设我们有以下的Vue模板代码：\n\n```html\n

{{ item.name }}

\n```\n\n这里我们使用`v-for`来循环渲染`items`数组，并且使用`v-if`来判断每个数组项是否是活动状态。现在，让我们看一下Vue的源码，特别是与渲染相关的部分。\n\n在Vue的渲染过程中，它会将模板解析为AST（抽象语法树），然后将AST转换为渲染函数。对于上面的模板，渲染函数大致如下：\n\n```javascript\nfunction render() {\n return _c(\n 'ul',\n null,\n _l(items, function(item) {\n return item.isActive ? _c('li', null, _v(_s(item.name))) : _e();\n })\n );\n}\n```\n\n上面的代码中，`_l`是由`v-for`指令生成的渲染函数。它接收一个数组和一个回调函数，并在每个数组项上调用回调函数。回调函数根据`v-if`条件来决定是否渲染`li`元素。\n\n问题出在这里：由于`v-for`的优先级比`v-if`高，所以每次渲染时都会执行`v-for`循环，无论`v-if`的条件是否为`false`。这意味着即使`item.isActive`为`false`，Vue仍然会对它进行遍历和渲染。\n\n此外，Vue在渲染时会尽量复用已经存在的元素，而不是重新创建和销毁它们。但是当`v-for`遍历的数据项发生变化时，Vue会使用具有相同`key`的元素。在上面的例子中，如果`item.isActive`从`true`变为`false`，Vue会尝试复用之前的`li`元素，并在其上应用`v-if`条件。这可能会导致一些不符合预期的行为。\n\n为了避免这种性能问题，Vue官方推荐在同一个元素上不要同时使用`v-if`和`v-for`。如果需要根据条件来决定是否渲染循环的元素，可以考虑使用计算属性或者`v-for`的过滤器来处理数据。或者，将条件判断放在外层元素上，内层元素使用`v-for`进行循环渲染，以确保每次渲染时都能正确地应用`v-if`条件。\n",{"_54":450,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/579/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/579/timeline",{"_54":453,"_56":57,"_58":454,"_60":455,"_62":456,"_64":457,"_66":458,"_68":459,"_70":460,"_72":461,"_74":462,"_107":463,"_134":135,"_136":26,"_137":-5,"_138":466,"_140":467,"_162":155,"_156":469,"_158":470,"_161":-5,"_165":166,"_167":471,"_172":-5,"_173":472,"_175":473,"_187":475,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/578","https://api.github.com/repos/pro-collection/interview-question/issues/578/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/578/comments","https://api.github.com/repos/pro-collection/interview-question/issues/578/events","https://github.com/pro-collection/interview-question/issues/578",1920672325,"I_kwDOJGDC6c5yeyJF",578,"将静态资源缓存在本地的方式有哪些？【热度: 584】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[464,465],{"_66":259,"_68":260,"_54":261,"_113":262,"_115":263,"_117":26,"_118":264},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":268,"_64":269,"_58":270,"_66":271,"_68":272,"_70":273,"_72":274,"_118":275,"_150":468,"_152":277,"_154":155,"_134":135,"_156":278,"_158":279,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-10-01T09:46:23Z","2023-10-01T09:46:24Z",{"_169":155,"_170":155,"_171":155},"**关键词**：静态资源缓存本地\n\n**浏览器可以使用以下几种方式将前端静态资源缓存在本地**：\n\n1. HTTP缓存：浏览器通过设置HTTP响应头中的Cache-Control或Expires字段来指定资源的缓存策略。常见的缓存策略有：no-cache（每次都请求服务器进行验证）、no-store（不缓存资源）、max-age（设置资源缓存的最大时间）等。浏览器根据这些缓存策略来决定是否将资源缓存在本地。\n\n2. ETag/If-None-Match：服务器可以通过在响应头中添加ETag字段，用于标识资源的版本号。当浏览器再次请求资源时，会将上次请求返回的ETag值通过If-None-Match字段发送给服务器，由服务器判断资源是否发生了变化。如果资源未发生变化，服务器会返回304 Not Modified状态码，浏览器则直接使用本地缓存的资源。\n\n3. Last-Modified/If-Modified-Since：服务器可以通过在响应头中添加Last-Modified字段，用于标识资源的最后修改时间。浏览器再次请求资源时，会将上次请求返回的Last-Modified值通过If-Modified-Since字段发送给服务器。服务器根据资源的最后修改时间判断资源是否发生了变化，如果未发生变化，则返回304 Not Modified状态码，浏览器使用本地缓存的资源。\n\n4. Service Worker缓存：使用Service Worker可以将前端资源缓存在浏览器的Service Worker缓存中。Service Worker是运行在浏览器后台的脚本，它可以拦截和处理网络请求，因此可以将前端资源缓存起来，并在离线状态下提供缓存的资源。\n\n5. LocalStorage或IndexedDB：对于一些小的静态资源，可以将其存储在浏览器的LocalStorage或IndexedDB中。这些存储方式是浏览器提供的本地存储机制，可以将数据以键值对的形式存储在浏览器中，从而实现缓存的效果。\n\n**如何将静态资源缓存在 LocalStorage或IndexedDB**\n\n以下是一个使用LocalStorage将静态资源缓存的示例代码：\n\n```javascript\n// 定义一个数组，包含需要缓存的静态资源的URL\nvar resources = [\n 'https://example.com/css/style.css',\n 'https://example.com/js/main.js',\n 'https://example.com/images/logo.png'\n];\n\n// 遍历资源数组，将资源请求并存储在LocalStorage中\nresources.forEach(function(url) {\n // 发起资源请求\n fetch(url)\n .then(function(response) {\n // 检查请求是否成功\n if (!response.ok) {\n throw new Error('Request failed: ' + response.status);\n }\n // 将响应数据存储在LocalStorage中\n return response.text();\n })\n .then(function(data) {\n // 将资源数据存储在LocalStorage中，以URL作为键名\n localStorage.setItem(url, data);\n console.log('Resource cached: ' + url);\n })\n .catch(function(error) {\n console.error(error);\n });\n});\n```\n\n以下是一个使用IndexedDB将静态资源缓存的示例代码：\n\n```javascript\n// 打开或创建一个IndexedDB数据库\nvar request = indexedDB.open('myDatabase', 1);\n\n// 创建或更新数据库的对象存储空间\nrequest.onupgradeneeded = function(event) {\n var db = event.target.result;\n var objectStore = db.createObjectStore('resources', { keyPath: 'url' });\n objectStore.createIndex('url', 'url', { unique: true });\n};\n\n// 成功打开数据库后，将资源请求并存储在IndexedDB中\nrequest.onsuccess = function(event) {\n var db = event.target.result;\n var transaction = db.transaction('resources', 'readwrite');\n var objectStore = transaction.objectStore('resources');\n\n resources.forEach(function(url) {\n // 发起资源请求\n fetch(url)\n .then(function(response) {\n // 检查请求是否成功\n if (!response.ok) {\n throw new Error('Request failed: ' + response.status);\n }\n // 将响应数据存储在IndexedDB中\n return response.blob();\n })\n .then(function(data) {\n // 创建一个资源对象，以URL作为键名\n var resource = { url: url, data: data };\n // 将资源对象存储在IndexedDB中\n objectStore.put(resource);\n console.log('Resource cached: ' + url);\n })\n .catch(function(error) {\n console.error(error);\n });\n });\n\n // 完成事务\n transaction.oncomplete = function() {\n console.log('All resources cached in IndexedDB.');\n };\n\n transaction.onerror = function(event) {\n console.error('Transaction error:', event.target.error);\n };\n};\n```\n\n以上代码仅为示例，实际应用中需要根据具体的需求进行相应的优化和错误处理。\n",{"_54":474,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/578/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/578/timeline",{"_54":477,"_56":57,"_58":478,"_60":479,"_62":480,"_64":481,"_66":482,"_68":483,"_70":484,"_72":485,"_74":486,"_107":487,"_134":135,"_136":26,"_137":-5,"_138":490,"_140":491,"_162":155,"_156":493,"_158":493,"_161":-5,"_165":166,"_167":494,"_172":-5,"_173":495,"_175":496,"_187":498,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/577","https://api.github.com/repos/pro-collection/interview-question/issues/577/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/577/comments","https://api.github.com/repos/pro-collection/interview-question/issues/577/events","https://github.com/pro-collection/interview-question/issues/577",1920670252,"I_kwDOJGDC6c5yexos",577,"SPA首屏加载速度慢的怎么解决【热度: 868】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[488,489],{"_66":259,"_68":260,"_54":261,"_113":262,"_115":263,"_117":26,"_118":264},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":268,"_64":269,"_58":270,"_66":271,"_68":272,"_70":273,"_72":274,"_118":275,"_150":492,"_152":277,"_154":155,"_134":135,"_156":278,"_158":279,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-10-01T09:41:30Z",{"_169":155,"_170":155,"_171":155},"**关键词**：SPA首屏、加快首屏加载\n\n**统计首屏时间**\n\n可以参考下面的文档：\n\n- https://github.com/pro-collection/interview-question/issues/515\n- https://github.com/pro-collection/interview-question/issues/516\n\n**影响首屏可能得因素**\n\n- 网络延时问题\n- 资源文件体积是否过大\n- 资源是否重复发送请求去加载了\n- 加载脚本的时候，渲染内容堵塞了\n\n\n**解决方案**\n\n- 减小入口文件积\n- 静态资源本地缓存\n- UI框架按需加载\n- 图片资源的压缩\n- 组件重复打包\n- 开启 GZip 压缩\n- 使用 SSR\n- 启用 CDN 加速\n",{"_54":497,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/577/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/577/timeline",{"_54":500,"_56":57,"_58":501,"_60":502,"_62":503,"_64":504,"_66":505,"_68":506,"_70":507,"_72":508,"_74":509,"_107":510,"_134":135,"_136":26,"_137":-5,"_138":519,"_140":520,"_162":155,"_156":532,"_158":532,"_161":-5,"_165":166,"_167":533,"_172":-5,"_173":534,"_175":535,"_187":537,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/570","https://api.github.com/repos/pro-collection/interview-question/issues/570/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/570/comments","https://api.github.com/repos/pro-collection/interview-question/issues/570/events","https://github.com/pro-collection/interview-question/issues/570",1919211406,"I_kwDOJGDC6c5yZNeO",570,"Object 对象有哪些场景 api ？【热度: 509】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[511,518],{"_66":512,"_68":513,"_54":514,"_113":515,"_115":516,"_117":26,"_118":517},5232521368,"LA_kwDOJGDC6c8AAAABN-HwmA","https://api.github.com/repos/pro-collection/interview-question/labels/JavaScript","JavaScript","A4D8FB","JavaScript 语法部分",{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":521,"_64":522,"_58":523,"_66":524,"_68":525,"_70":192,"_72":526,"_118":527,"_150":528,"_152":529,"_154":155,"_134":135,"_156":530,"_158":531,"_160":-5,"_161":-5},"https://api.github.com/repos/pro-collection/interview-question/milestones/1","https://github.com/pro-collection/interview-question/milestone/1","https://api.github.com/repos/pro-collection/interview-question/milestones/1/labels",9124541,"MI_kwDOJGDC6c4Aizq9","初","初级面试问题",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},79,"2023-03-06T14:59:51Z","2024-11-22T14:22:55Z","2023-09-29T12:46:39Z",{"_169":155,"_170":155,"_171":155},"**关键词**：Object对象api\n\n| 方法/属性 | 描述 |\n| ------------------------------ | ------------------------------------------------------------ |\n| `Object.keys(obj)` | 返回一个由给定对象的所有可枚举自身属性的名称组成的数组 |\n| `Object.values(obj)` | 返回一个给定对象所有可枚举属性值的数组 |\n| `Object.entries(obj)` | 返回一个给定对象自身可枚举属性的 [key, value] 数组 |\n| `Object.assign(target, ...sources)` | 将一个或多个源对象的可枚举属性复制到目标对象，并返回目标对象 |\n| `Object.create(proto, [propertiesObject])` | 使用指定的原型对象和属性创建一个新对象 |\n| `Object.defineProperty(obj, prop, descriptor)` | 定义对象中的新属性或修改现有属性的配置 |\n| `Object.getOwnPropertyDescriptor(obj, prop)` | 返回指定对象上一个自有属性对应的属性描述符 |\n| `Object.freeze(obj)` | 冻结一个对象，使其属性无法修改、添加或删除 |\n| `Object.is(value1, value2)` | 判断两个值是否相同 |\n| `Object.seal(obj)` | 封闭一个对象，防止向对象添加新属性，但允许修改或删除现有属性 |\n| `Object.getPrototypeOf(obj)` | 返回指定对象的原型（`__proto__`） |\n| `Object.setPrototypeOf(obj, proto)` | 设置指定对象的原型（`__proto__`） |\n",{"_54":536,"_178":192,"_179":192,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/570/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/570/timeline",{"_54":539,"_56":57,"_58":540,"_60":541,"_62":542,"_64":543,"_66":544,"_68":545,"_70":546,"_72":547,"_74":548,"_107":549,"_134":135,"_136":26,"_137":-5,"_138":557,"_140":558,"_162":155,"_156":560,"_158":560,"_161":-5,"_165":166,"_167":561,"_172":-5,"_173":562,"_175":563,"_187":565,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/568","https://api.github.com/repos/pro-collection/interview-question/issues/568/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/568/comments","https://api.github.com/repos/pro-collection/interview-question/issues/568/events","https://github.com/pro-collection/interview-question/issues/568",1910291617,"I_kwDOJGDC6c5x3Lyh",568,"实现日期格式化 format 函数【热度: 489】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[550,551],{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},{"_66":552,"_68":553,"_54":554,"_113":555,"_115":263,"_117":26,"_118":556},5931045040,"LA_kwDOJGDC6c8AAAABYYSQsA","https://api.github.com/repos/pro-collection/interview-question/labels/%E4%BB%A3%E7%A0%81%E5%AE%9E%E7%8E%B0/%E7%AE%97%E6%B3%95","代码实现/算法","代码实现或者算法实现",[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":559,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-09-24T16:14:06Z",{"_169":155,"_170":155,"_171":155},"**关键词**：日期format函数、日期format实现\n\n**问题**\n```ts\n// js 实现日期的 format 函数\n//\n// YYYY 对应年\n// MM 对应月\n// DD 对应日\n//\n// HH 对应 24 小时制度\n// hh 对应 12 小时制度\n// mm 对应分钟\n// ss 对应秒\n\nconst date = new Date();\nconst formattedDate = date.format('YYYY-MM-DD HH:mm:ss');\nconsole.log(formattedDate); // 输出结果为当前日期和时间的格式化字符串\n```\n\n\n**解答**\n以下是使用JavaScript实现日期格式化的`format`函数：\n\n```javascript\nDate.prototype.format = function (format) {\n const date = this;\n\n const year = date.getFullYear();\n const month = date.getMonth() + 1;\n const day = date.getDate();\n const hours = date.getHours();\n const minutes = date.getMinutes();\n const seconds = date.getSeconds();\n\n format = format.replace('YYYY', year);\n format = format.replace('MM', month.toString().padStart(2, '0'));\n format = format.replace('DD', day.toString().padStart(2, '0'));\n format = format.replace('HH', hours.toString().padStart(2, '0'));\n format = format.replace('hh', (hours % 12).toString().padStart(2, '0'));\n format = format.replace('mm', minutes.toString().padStart(2, '0'));\n format = format.replace('ss', seconds.toString().padStart(2, '0'));\n\n return format;\n};\n\n// 示例用法\nconst date = new Date();\nconst formattedDate = date.format('YYYY-MM-DD HH:mm:ss');\nconsole.log(formattedDate); // 输出结果为当前日期和时间的格式化字符串\n```\n\n上述代码中，我们通过在`Date`对象的原型上定义`format`函数，使得所有的`Date`对象都可以调用`format`函数进行日期格式化。在函数内部，我们使用`getFullYear`、`getMonth`、`getDate`等方法获取日期的年、月、日、时、分、秒的值，并将其替换到传入的`format`字符串中对应的占位符。最后返回格式化后的字符串。\n",{"_54":564,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/568/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/568/timeline",{"_54":567,"_56":57,"_58":568,"_60":569,"_62":570,"_64":571,"_66":572,"_68":573,"_70":574,"_72":575,"_74":576,"_107":577,"_134":135,"_136":26,"_137":-5,"_138":580,"_140":581,"_162":155,"_156":583,"_158":583,"_161":-5,"_165":166,"_167":584,"_172":-5,"_173":585,"_175":586,"_187":588,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/567","https://api.github.com/repos/pro-collection/interview-question/issues/567/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/567/comments","https://api.github.com/repos/pro-collection/interview-question/issues/567/events","https://github.com/pro-collection/interview-question/issues/567",1910290192,"I_kwDOJGDC6c5x3LcQ",567,"实现一个函数，计算两个日期之间的天数差",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[578,579],{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},{"_66":552,"_68":553,"_54":554,"_113":555,"_115":263,"_117":26,"_118":556},[],{"_54":521,"_64":522,"_58":523,"_66":524,"_68":525,"_70":192,"_72":526,"_118":527,"_150":582,"_152":529,"_154":155,"_134":135,"_156":530,"_158":531,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-09-24T16:09:44Z",{"_169":155,"_170":155,"_171":155},"以下是使用JavaScript实现计算两个日期之间的天数差的函数：\n\n```javascript\nfunction calculateDateDifference(date1, date2) {\n // 将日期字符串转换为 Date 对象\n const d1 = new Date(date1);\n const d2 = new Date(date2);\n\n // 计算两个日期的时间差（毫秒数）\n const timeDiff = Math.abs(d2.getTime() - d1.getTime());\n\n // 将时间差转换为天数\n const daysDiff = Math.ceil(timeDiff / (1000 * 3600 * 24));\n\n return daysDiff;\n}\n\n// 示例用法\nconst date1 = '2022-01-01';\nconst date2 = '2022-01-10';\n\nconst difference = calculateDateDifference(date1, date2);\nconsole.log(difference); // 输出结果为 9\n```\n\n上述函数首先将两个日期字符串转换为Date对象，然后计算两个日期对象之间的时间差（以毫秒表示），最后将时间差转换为天数。通过调用`calculateDateDifference`函数，可以获取两个日期之间的天数差。\n",{"_54":587,"_178":192,"_179":192,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/567/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/567/timeline",{"_54":590,"_56":57,"_58":591,"_60":592,"_62":593,"_64":594,"_66":595,"_68":596,"_70":597,"_72":598,"_74":599,"_107":600,"_134":135,"_136":26,"_137":-5,"_138":603,"_140":604,"_162":192,"_156":606,"_158":607,"_161":-5,"_165":166,"_167":608,"_172":-5,"_173":609,"_175":610,"_187":612,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/566","https://api.github.com/repos/pro-collection/interview-question/issues/566/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/566/comments","https://api.github.com/repos/pro-collection/interview-question/issues/566/events","https://github.com/pro-collection/interview-question/issues/566",1910283387,"I_kwDOJGDC6c5x3Jx7",566,"https 如何保证安全的？【热度: 782】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[601,602],{"_66":110,"_68":111,"_54":112,"_113":114,"_115":116,"_117":26,"_118":119},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":605,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-09-24T16:00:12Z","2023-09-24T16:01:39Z",{"_169":155,"_170":155,"_171":155},"**关键词**：https 安全性\r\n\r\nHTTPS相比HTTP更安全的原因主要有以下几点：\r\n\r\n1. 数据传输加密：HTTPS使用SSL/TLS协议对数据进行加密传输，通过使用对称密钥加密传输数据，并使用非对称密钥进行身份验证和密钥交换。这意味着即使攻击者截获了数据包，也无法解密其中的内容。\r\n\r\n2. 身份验证和数据完整性：HTTPS使用数字证书对网站进行身份验证，确保用户连接的是正确的网站。同时，数字证书也用于确保数据的完整性，以防止数据在传输过程中被篡改。\r\n\r\n3. 防止中间人攻击：HTTPS通过使用公钥加密和数字签名等技术，可以防止中间人攻击。中间人攻击是指攻击者在用户与服务器之间插入自己的恶意代理，在两者之间进行通信并窃取敏感信息。\r\n\r\n4. HTTP头隐私保护：HTTPS可以提供对HTTP头信息的隐私保护，防止攻击者通过分析HTTP头信息获取用户的敏感信息。\r\n\r\nHTTPS通过数据加密、身份验证和数据完整性保护等机制，提供了更高的安全性，能够有效防止数据被窃取、篡改和中间人攻击等风险。相比之下，HTTP是明文传输，不具备这些安全保护机制。因此，对于需要保护用户隐私和防止数据被攻击的网站，使用HTTPS是更安全的选择。\r\n\r\n",{"_54":611,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/566/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/566/timeline",{"_54":614,"_56":57,"_58":615,"_60":616,"_62":617,"_64":618,"_66":619,"_68":620,"_70":621,"_72":622,"_74":623,"_107":624,"_134":135,"_136":26,"_137":-5,"_138":627,"_140":628,"_162":155,"_156":630,"_158":630,"_161":-5,"_165":166,"_167":631,"_172":-5,"_173":632,"_175":633,"_187":635,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/564","https://api.github.com/repos/pro-collection/interview-question/issues/564/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/564/comments","https://api.github.com/repos/pro-collection/interview-question/issues/564/events","https://github.com/pro-collection/interview-question/issues/564",1910278106,"I_kwDOJGDC6c5x3Ifa",564,"JavaScript 中，隐藏类是什么概念？【热度: 146】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[625,626],{"_66":512,"_68":513,"_54":514,"_113":515,"_115":516,"_117":26,"_118":517},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":268,"_64":269,"_58":270,"_66":271,"_68":272,"_70":273,"_72":274,"_118":275,"_150":629,"_152":277,"_154":155,"_134":135,"_156":278,"_158":279,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-09-24T15:43:30Z",{"_169":155,"_170":155,"_171":155},"**关键词**：JavaScript隐藏类\n\n隐藏类是JavaScript引擎中的一种优化技术，用于提高对象访问的性能。隐藏类是一种数据结构，用于跟踪对象的属性和方法的布局和类型，以便在代码运行时能够快速访问它们。\n\n当JavaScript引擎在执行代码时，会动态地创建对象的隐藏类。隐藏类会跟踪对象的属性和方法，并为它们分配固定的内存偏移量。每当对象的属性和方法发生变化时，隐藏类会根据变化的情况进行更新。\n\n使用隐藏类可以提高代码的执行速度，因为JavaScript引擎可以根据隐藏类的信息来直接定位和访问对象的属性和方法，而不需要进行动态查找或解析。这种优化技术可以减少对象访问的开销，提高代码的性能。\n\n需要注意的是，隐藏类是在运行时动态创建的，因此代码中创建对象的顺序和属性的添加顺序都会影响隐藏类的生成。如果对象的属性添加顺序不一致，可能会导致隐藏类的生成不一致，从而降低代码的性能。\n\n隐藏类是现代JavaScript引擎（如V8、SpiderMonkey等）中的一项重要优化技术，可以显著提高JavaScript代码的执行速度。\n\n\n下面是一个使用隐藏类的简单示例：\n\n```javascript\nfunction MyClass(a, b) {\n this.prop1 = a;\n this.prop2 = b;\n}\n\nMyClass.prototype.method1 = function() {\n console.log(\"Method 1\");\n};\n\nMyClass.prototype.method2 = function() {\n console.log(\"Method 2\");\n};\n\nvar obj1 = new MyClass(10, 20);\nvar obj2 = new MyClass(30, 40);\n\nobj1.method1(); // 输出 \"Method 1\"\nobj2.method2(); // 输出 \"Method 2\"\n```\n\n在上面的示例中，我们创建了一个名为`MyClass`的类，它有两个属性`prop1`和`prop2`，以及两个方法`method1`和`method2`。我们用`new`关键字创建了两个实例`obj1`和`obj2`。\n\n当我们使用隐藏类优化的JavaScript引擎运行这段代码时，它会动态地创建隐藏类来跟踪`MyClass`的属性和方法。每个实例都会有一个关联的隐藏类，它包含了实例的属性和方法的布局和类型信息。\n\n在调用`obj1.method1()`和`obj2.method2()`时，JavaScript引擎会使用隐藏类的信息来直接定位并执行相应的方法，而不需要进行动态查找和解析，从而提高了代码的执行速度。\n\n需要注意的是，这只是一个简单的示例，实际上隐藏类的优化是更复杂和细致的。不同的引擎可能会有不同的隐藏类实现方式，并且隐藏类的生成和优化过程会受到许多因素的影响，如代码的结构、对象的属性访问模式等。\n",{"_54":634,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/564/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/564/timeline",{"_54":637,"_56":57,"_58":638,"_60":639,"_62":640,"_64":641,"_66":642,"_68":643,"_70":644,"_72":645,"_74":646,"_107":647,"_134":135,"_136":26,"_137":-5,"_138":650,"_140":651,"_162":155,"_156":653,"_158":653,"_161":-5,"_165":166,"_167":654,"_172":-5,"_173":655,"_175":656,"_187":658,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/563","https://api.github.com/repos/pro-collection/interview-question/issues/563/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/563/comments","https://api.github.com/repos/pro-collection/interview-question/issues/563/events","https://github.com/pro-collection/interview-question/issues/563",1910277593,"I_kwDOJGDC6c5x3IXZ",563,"JavaScript 如何做内存管理？【热度: 603】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[648,649],{"_66":512,"_68":513,"_54":514,"_113":515,"_115":516,"_117":26,"_118":517},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":652,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-09-24T15:41:49Z",{"_169":155,"_170":155,"_171":155},"**关键词**：JavaScript内存管理\n\nJavaScript中的内存管理是由垃圾收集器负责的。垃圾收集器会自动追踪不再使用的对象，并在适当的时候释放它们占用的内存。\n\nJavaScript的垃圾收集器使用了一种称为\"**标记-清除**\"（mark and sweep）的算法来确定哪些对象是不再需要的。该算法通过标记所有被引用的对象，然后清除未被标记的对象。\n\n以下是JavaScript中的一些内存管理的原则和技巧：\n\n1. 自动内存管理：JavaScript的垃圾收集器会自动管理内存，不需要手动释放内存。你只需确保不再使用的对象没有被引用，垃圾收集器会在适当的时候自动回收内存。\n\n2. 避免全局变量：全局变量会一直存在于内存中，直到页面关闭。尽量减少使用全局变量，而是使用函数作用域或模块化的方式来限制变量的作用范围。\n\n3. 及时释放引用：当你不再需要一个对象时，最好将对它的引用设置为null，这样可以使垃圾收集器更早地释放对象所占用的内存。\n\n4. 避免循环引用：如果对象之间存在循环引用，即使它们已经不再被使用，垃圾收集器也不会自动释放它们。确保及时断开循环引用，使垃圾收集器能够正确地回收内存。\n\n5. 避免大量对象的创建和销毁：频繁地创建和销毁大量对象会导致垃圾收集器频繁地执行，影响性能。如果可能的话，尽量重用对象，而不是频繁地创建和销毁它们。\n\n虽然JavaScript的垃圾收集器自动管理内存，但仍然需要开发人员编写高效的代码来避免内存泄漏和浪费，以确保JavaScript应用程序的性能和可靠性。\n",{"_54":657,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/563/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/563/timeline",{"_54":660,"_56":57,"_58":661,"_60":662,"_62":663,"_64":664,"_66":665,"_68":666,"_70":667,"_72":668,"_74":669,"_107":670,"_134":135,"_136":26,"_137":-5,"_138":673,"_140":674,"_162":155,"_156":676,"_158":677,"_161":-5,"_165":166,"_167":678,"_172":-5,"_173":679,"_175":680,"_187":682,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/554","https://api.github.com/repos/pro-collection/interview-question/issues/554/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/554/comments","https://api.github.com/repos/pro-collection/interview-question/issues/554/events","https://github.com/pro-collection/interview-question/issues/554",1899349862,"I_kwDOJGDC6c5xNcdm",554,"如何理解数据驱动视图，有哪些核心要素？【热度: 943】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[671,672],{"_66":121,"_68":122,"_54":123,"_113":124,"_115":125,"_117":26,"_118":126},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":675,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-09-16T08:14:11Z","2023-09-16T08:14:12Z",{"_169":155,"_170":155,"_171":155},"**关键词**：理解数据驱动视图\n\n数据驱动视图是指将数据作为主要驱动力，通过对数据的处理和分析，动态地更新和呈现视图的过程。它强调将数据与视图进行解耦，使得视图的呈现可以根据数据的变化自动更新，实现更灵活、可扩展和可维护的视图。\n\n数据驱动视图的核心要素包括：\n\n1. 数据源：数据驱动视图需要有一个或多个数据源，这些数据源可以是来自数据库、API接口、文件等不同的来源。\n\n2. 数据处理：对数据进行处理和分析的过程。这包括对数据进行清洗、过滤、转换、计算等操作，以便于后续的视图呈现。\n\n3. 视图模板：视图模板定义了视图的结构和样式，并指定了如何将数据展示在视图中。视图模板通常使用一种模板语言，可以根据数据的变化自动生成最终的视图。\n\n4. 视图更新机制：视图更新机制是指如何根据数据的变化自动更新视图。这可以基于事件驱动的方式，当数据发生变化时主动更新视图；也可以采用响应式编程的方式，通过观察数据的变化来自动更新视图。\n\n5. 用户交互：数据驱动视图通常与用户进行交互，用户可以通过界面操作改变数据，从而触发视图的更新。用户交互可以通过表单、按钮、滑块等不同的方式实现。\n\n通过将数据与视图解耦，数据驱动视图可以实现更灵活、可扩展和可维护的视图呈现方式。同时，它也可以提高开发效率，减少开发人员对视图的手动管理。\n",{"_54":681,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/554/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/554/timeline",{"_54":684,"_56":57,"_58":685,"_60":686,"_62":687,"_64":688,"_66":689,"_68":690,"_70":691,"_72":692,"_74":693,"_107":694,"_134":135,"_136":26,"_137":-5,"_138":697,"_140":698,"_162":155,"_156":700,"_158":701,"_161":-5,"_165":166,"_167":702,"_172":-5,"_173":703,"_175":704,"_187":706,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/553","https://api.github.com/repos/pro-collection/interview-question/issues/553/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/553/comments","https://api.github.com/repos/pro-collection/interview-question/issues/553/events","https://github.com/pro-collection/interview-question/issues/553",1899349328,"I_kwDOJGDC6c5xNcVQ",553,"WeakMap 是什么样的数据结构【热度: 431】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[695,696],{"_66":512,"_68":513,"_54":514,"_113":515,"_115":516,"_117":26,"_118":517},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":699,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-09-16T08:12:16Z","2023-09-16T08:12:45Z",{"_169":155,"_170":155,"_171":155},"**关键词**：WeakMap应用、WeakMap数据、WeakMap api\n\n**基本概念**\n\nWeakMap 是一种键值对存储的数据结构，类似于 Map。它的特点是键必须是对象，值可以是任意类型的数据。\n\nWeakMap 内部使用了引用计数的方式来判断键是否存活，当键不再被引用时，垃圾回收机制会自动清除对应的键值对。这意味着如果没有其他地方引用该键，WeakMap 中的键值对会被自动清理，并释放内存。\n\n与 Map 不同的是，WeakMap 的键是弱引用，不会阻止垃圾回收。这意味着在 WeakMap 中，键不能被枚举、迭代或获取键的数量。同时，WeakMap 也没有提供像 Map 中的 size 属性和 clear 方法。\n\n因为键是弱引用，所以 WeakMap 也不能使用普通对象作为键，只能使用具有引用类型的对象作为键。这是为了避免内存泄漏问题，因为如果键是普通对象，即使它没有被其他地方引用，也无法被垃圾回收。\n\n因为 WeakMap 的键是弱引用并且没有提供常用的方法，所以它的使用场景相对有限，主要用于存储对象的私有数据或附加元数据。\n\n**有哪些 api**\n\nWeakMap 提供了以下的 API：\n\n- `set(key, value)`: 向 WeakMap 中设置键值对，键必须是对象。\n- `get(key)`: 获取指定键对应的值。\n- `has(key)`: 判断指定键是否存在于 WeakMap 中。\n- `delete(key)`: 删除指定键对应的键值对。\n- 注意：WeakMap 没有提供 `size` 属性和 `clear` 方法，也不能直接迭代或枚举键。\n\n需要注意的是，由于 WeakMap 的键是弱引用，只能使用对象作为键，同时也意味着无法通过值来查找对应的键。所以 WeakMap 适用于需要存储对象的私有数据或附加元数据的场景，而不适合用于需要根据值来查找键的情况。\n",{"_54":705,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/553/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/553/timeline",{"_54":708,"_56":57,"_58":709,"_60":710,"_62":711,"_64":712,"_66":713,"_68":714,"_70":715,"_72":716,"_74":717,"_107":718,"_134":135,"_136":26,"_137":-5,"_138":721,"_140":722,"_162":724,"_156":725,"_158":726,"_161":-5,"_165":166,"_167":727,"_172":-5,"_173":728,"_175":729,"_187":731,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/551","https://api.github.com/repos/pro-collection/interview-question/issues/551/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/551/comments","https://api.github.com/repos/pro-collection/interview-question/issues/551/events","https://github.com/pro-collection/interview-question/issues/551",1884318813,"I_kwDOJGDC6c5wUGxd",551,"[代码实现] JS 中数组深对比实现【热度: 985】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[719,720],{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},{"_66":552,"_68":553,"_54":554,"_113":555,"_115":263,"_117":26,"_118":556},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":723,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},6,"2023-09-06T16:00:24Z","2024-08-01T12:15:28Z",{"_169":155,"_170":155,"_171":155},"**关键词**：JS数组对比\r\n\r\n在JavaScript中，可以使用递归的方式实现数组的深度对比。以下是一个示例函数，用于比较两个数组是否相等：\r\n\r\n```javascript\r\n// 判断对象是否相同\r\nfunction deepEqual(obj1, obj2) {\r\n // 检查类型是否相同\r\n if (typeof obj1 !== typeof obj2) {\r\n return false;\r\n }\r\n \r\n // 检查是否是对象或数组\r\n if (typeof obj1 === 'object' && obj1 !== null && obj2 !== null) {\r\n // 检查对象或数组长度是否相同\r\n if (Object.keys(obj1).length !== Object.keys(obj2).length) {\r\n return false;\r\n }\r\n \r\n for (let key in obj1) {\r\n // 递归比较每个属性的值\r\n if (!deepEqual(obj1[key], obj2[key])) {\r\n return false;\r\n }\r\n }\r\n \r\n return true;\r\n }\r\n \r\n // 比较基本类型的值\r\n return obj1 === obj2;\r\n}\r\n\r\nfunction deepArrayEqual(arr1, arr2) {\r\n // 检查数组长度是否相同\r\n if (arr1.length !== arr2.length) {\r\n return false;\r\n }\r\n \r\n for (let i = 0; i < arr1.length; i++) {\r\n const value1 = arr1[i];\r\n const value2 = arr2[i];\r\n \r\n // 递归比较每个元素的值\r\n if (Array.isArray(value1) && Array.isArray(value2)) {\r\n if (!deepArrayEqual(value1, value2)) {\r\n return false;\r\n }\r\n } else if (typeof value1 === 'object' && typeof value2 === 'object') {\r\n if (!deepEqual(value1, value2)) {\r\n return false;\r\n }\r\n } else {\r\n // 比较基本类型的值\r\n if (value1 !== value2) {\r\n return false;\r\n }\r\n }\r\n }\r\n \r\n return true;\r\n}\r\n```\r\n\r\n使用示例：\r\n\r\n```javascript\r\nconst arr1 = [1, [2, 3], { name: 'John' }];\r\nconst arr2 = [1, [2, 3], { name: 'John' }];\r\nconst arr3 = [1, [2, 3], { name: 'Jane' }];\r\n\r\nconsole.log(deepArrayEqual(arr1, arr2)); // true\r\nconsole.log(deepArrayEqual(arr1, arr3)); // false\r\n```\r\n\r\n在上述示例中，`deepArrayEqual`函数会递归比较两个数组的每个元素的值，包括嵌套的数组和对象。如果两个数组是相等的，则返回`true`，否则返回`false`。注意，该函数不会检查函数、正则表达式、日期等复杂类型的值。\r\n",{"_54":730,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/551/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/551/timeline",{"_54":733,"_56":57,"_58":734,"_60":735,"_62":736,"_64":737,"_66":738,"_68":739,"_70":740,"_72":741,"_74":742,"_107":743,"_134":135,"_136":26,"_137":-5,"_138":746,"_140":747,"_162":155,"_156":749,"_158":750,"_161":-5,"_165":166,"_167":751,"_172":-5,"_173":752,"_175":753,"_187":755,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/535","https://api.github.com/repos/pro-collection/interview-question/issues/535/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/535/comments","https://api.github.com/repos/pro-collection/interview-question/issues/535/events","https://github.com/pro-collection/interview-question/issues/535",1867233833,"I_kwDOJGDC6c5vS7op",535,"如何实现大文件断点续传【热度: 897】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[744,745],{"_66":110,"_68":111,"_54":112,"_113":114,"_115":116,"_117":26,"_118":119},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":748,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-08-25T15:15:00Z","2023-08-25T15:15:26Z",{"_169":155,"_170":155,"_171":155},"**关键词**：文件上传断点续传\n\n前端实现断点续传一般涉及到以下几个步骤：\n\n1. 分片上传：将大文件分割成多个小的文件块。可以使用 JavaScript 的 `File` 对象的 `slice` 方法来实现分片。\n\n2. 上传文件块：使用 XMLHttpRequest 或 Fetch API 发送每个文件块到服务器。可以将每个文件块的索引、总文件大小等信息一同发送到服务器。\n\n3. 保存上传进度：在每个文件块上传成功后，可以将已上传的块数、已上传的字节数等信息保存到本地，以便在继续上传时恢复进度。\n\n4. 续传：在继续上传时，先从本地恢复已上传的进度信息。然后根据已上传的字节数，计算出下一个文件块的起始位置，然后继续上传剩余的文件块。\n\n5. 合并文件块：在所有文件块都上传完成后，服务器可以将这些文件块合并为完整的文件。可以通过将所有文件块的内容拼接在一起或使用服务器端的工具进行合并。\n\n需要注意的是，断点续传的实现还需要服务器端的支持。服务器端需要接收和处理分片上传的请求，并保存和管理已上传的文件块，以便在续传时恢复文件的完整性。因此，前端实现断点续传需要和后端进行协作。\n",{"_54":754,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/535/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/535/timeline",{"_54":757,"_56":57,"_58":758,"_60":759,"_62":760,"_64":761,"_66":762,"_68":763,"_70":764,"_72":765,"_74":766,"_107":767,"_134":135,"_136":26,"_137":-5,"_138":770,"_140":771,"_162":155,"_156":773,"_158":774,"_161":-5,"_165":166,"_167":775,"_172":-5,"_173":776,"_175":777,"_187":779,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/534","https://api.github.com/repos/pro-collection/interview-question/issues/534/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/534/comments","https://api.github.com/repos/pro-collection/interview-question/issues/534/events","https://github.com/pro-collection/interview-question/issues/534",1867227476,"I_kwDOJGDC6c5vS6FU",534,"长连接了解多少【热度: 567】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[768,769],{"_66":110,"_68":111,"_54":112,"_113":114,"_115":116,"_117":26,"_118":119},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":772,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-08-25T15:10:41Z","2023-08-25T15:10:56Z",{"_169":155,"_170":155,"_171":155},"**关键词**：http 长连接过程\n\nHTTP/1.1 的长连接（Keep-Alive）是一种机制，使客户端和服务器在同一连接上可以发送和接收多个 HTTP 请求和响应。它的原理如下：\n\n1. 客户端发送请求：当客户端发起一个 HTTP 请求时，在请求头中会包含一个 `Connection` 字段，标识这个连接是否需要保持持久连接。如果客户端希望保持连接，它会将该字段设置为 `keep-alive`。\n\n2. 服务器响应：当服务器收到客户端的请求后，如果它支持长连接，它会在响应头中添加一个 `Connection` 字段，也设置为 `keep-alive`，表示服务器同意保持连接。\n\n3. 客户端发送下一个请求：在客户端收到服务器的响应后，如果它也同意保持连接，客户端可以继续发送下一个请求。这个请求会被发送到同一连接上，而不是创建一个新的连接。\n\n4. 保持连接或关闭连接：客户端和服务器可以在多个请求和响应之间重复步骤 3。当一方决定不再继续发送请求时，它可以在请求头或响应头中将 `Connection` 字段设置为 `close`，表示关闭连接。\n\n长连接的原理是通过减少连接的建立和关闭次数，来提高性能和效率。它可以减少网络延迟和连接建立的开销，从而加快请求和响应的传输速度。同时，长连接还可以减少服务器的负载，因为服务器不需要频繁地处理连接的建立和关闭。\n\n需要注意的是，尽管 HTTP/1.1 支持长连接，但它并不是默认启用的，需要在请求头中明确指定 `Connection: keep-alive` 才能使用长连接。此外，服务器也可以在响应头中明确指定长连接。如果客户端和服务器都支持长连接，并在请求和响应中都明确设置了长连接，那么连接就会被保持，直到其中一方关闭连接或指定关闭。\n",{"_54":778,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/534/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/534/timeline",{"_54":781,"_56":57,"_58":782,"_60":783,"_62":784,"_64":785,"_66":786,"_68":787,"_70":788,"_72":789,"_74":790,"_107":791,"_134":135,"_136":26,"_137":-5,"_138":800,"_140":801,"_162":803,"_156":804,"_158":805,"_161":-5,"_165":166,"_167":806,"_172":-5,"_173":807,"_175":808,"_187":810,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/495","https://api.github.com/repos/pro-collection/interview-question/issues/495/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/495/comments","https://api.github.com/repos/pro-collection/interview-question/issues/495/events","https://github.com/pro-collection/interview-question/issues/495",1822710283,"I_kwDOJGDC6c5spFoL",495,"原生 js 如何进行监听路由的变化【热度: 906】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[792,799],{"_66":793,"_68":794,"_54":795,"_113":796,"_115":797,"_117":26,"_118":798},5252299764,"LA_kwDOJGDC6c8AAAABOQ-79A","https://api.github.com/repos/pro-collection/interview-question/labels/%E6%B5%8F%E8%A7%88%E5%99%A8","浏览器","f9d0c4","浏览器相关知识点",{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":802,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},4,"2023-07-26T15:48:43Z","2023-09-05T07:30:20Z",{"_169":155,"_170":155,"_171":155},"**关键词**：原生路由监听\n\n在原生 JavaScript 中，可以使用 window 对象上的 popstate 事件来监听路由的变化。popstate 事件在浏览器的历史记录发生变化时触发，包括当用户点击浏览器的前进或后退按钮、调用 history.pushState() 或 history.replaceState() 方法等。\n\n下面是一个简单的示例代码，演示如何使用 popstate 事件监听路由的变化：\n\n```javascript\n// 监听 popstate 事件\nwindow.addEventListener('popstate', function(event) {\n // 在这里可以执行路由变化后的处理逻辑\n console.log('路由发生了变化');\n});\n\n// 修改 URL 并添加一条历史记录\nhistory.pushState(null, null, '/new-route');\n\n// 或者使用 history.replaceState() 方法替换当前历史记录\n// history.replaceState(null, null, '/new-route');\n```\n\n在上面的代码中，当 popstate 事件触发时，回调函数会被执行。你可以在回调函数中添加适当的处理逻辑，例如更新页面内容、重新渲染视图等。\n\n需要注意的是，popstate 事件不会在页面加载时触发，因此如果你需要在页面加载时执行一些初始化的路由处理逻辑，可以将该逻辑封装为一个函数，并在加载时调用一次，然后再通过 popstate 事件监听路由的变化。\n\n另外，还可以使用 history.state 属性来获取当前历史记录的状态对象，该对象可以在调用 history.pushState() 或 history.replaceState() 方法时传入。这样可以在 popstate 事件回调函数中访问和使用该状态对象。\n\n```javascript\nwindow.addEventListener('popstate', function(event) {\n var state = history.state;\n // 在这里可以访问和使用历史记录的状态对象\n});\n```\n\n通过监听 popstate 事件，可以在原生 JavaScript 中轻松地监听和响应路由的变化，从而实现相应的页面切换和处理逻辑。\n",{"_54":809,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/495/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/495/timeline",{"_54":812,"_56":57,"_58":813,"_60":814,"_62":815,"_64":816,"_66":817,"_68":818,"_70":819,"_72":820,"_74":821,"_107":822,"_134":135,"_136":26,"_137":-5,"_138":825,"_140":826,"_162":155,"_156":828,"_158":829,"_161":-5,"_165":166,"_167":830,"_172":-5,"_173":831,"_175":832,"_187":834,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/472","https://api.github.com/repos/pro-collection/interview-question/issues/472/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/472/comments","https://api.github.com/repos/pro-collection/interview-question/issues/472/events","https://github.com/pro-collection/interview-question/issues/472",1791635103,"I_kwDOJGDC6c5qyi6f",472,"用 nodejs 实现一个命令行工具，统计输入目录下面指定代码的行数【热度: 732】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[823,824],{"_66":121,"_68":122,"_54":123,"_113":124,"_115":125,"_117":26,"_118":126},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":827,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-07-06T14:03:51Z","2023-07-06T14:04:04Z",{"_169":155,"_170":155,"_171":155},"**关键词**：统计指定目录下代码行数\n\n要实现一个命令行工具来统计输入目录下指定代码的行数，你可以使用Node.js的`fs`模块来读取文件内容并进行行数统计。以下是一个简单的实现示例：\n\n```javascript\nconst fs = require('fs');\nconst path = require('path');\n\nfunction countLinesInDirectory(dirPath, fileExtension) {\n let totalLines = 0;\n\n function countLinesInFile(filePath) {\n const content = fs.readFileSync(filePath, 'utf-8');\n const lines = content.split('\\n');\n totalLines += lines.length;\n }\n\n function processDirectory(directoryPath) {\n const files = fs.readdirSync(directoryPath);\n\n files.forEach((file) => {\n const filePath = path.join(directoryPath, file);\n const stats = fs.statSync(filePath);\n\n if (stats.isFile() && path.extname(file) === fileExtension) {\n countLinesInFile(filePath);\n } else if (stats.isDirectory()) {\n processDirectory(filePath);\n }\n });\n }\n\n processDirectory(dirPath);\n\n return totalLines;\n}\n\n// 命令行参数，第一个参数是目录路径，第二个参数是文件扩展名\nconst [_, __, dirPath, fileExtension] = process.argv;\n\nconst linesCount = countLinesInDirectory(dirPath, fileExtension);\nconsole.log(`Total lines of ${fileExtension} files in ${dirPath}: ${linesCount}`);\n```\n\n你可以将上述代码保存为一个JavaScript文件，比如`line-counter.js`。然后，在终端中运行以下命令：\n\n```\nnode line-counter.js /path/to/directory .js\n```\n\n其中`/path/to/directory`是你要统计的目录路径，`.js`是你要统计的文件扩展名。运行命令后，程序将会输出指定文件类型在指定目录中的总行数。\n\n你可以根据需要自定义输出格式、文件过滤规则等。此示例只是一个基本的实现，你可以根据具体需求进行扩展和优化。\n",{"_54":833,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/472/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/472/timeline",{"_54":836,"_56":57,"_58":837,"_60":838,"_62":839,"_64":840,"_66":841,"_68":842,"_70":843,"_72":844,"_74":845,"_107":846,"_134":135,"_136":26,"_137":-5,"_138":849,"_140":850,"_162":155,"_156":852,"_158":853,"_161":-5,"_165":166,"_167":854,"_172":-5,"_173":855,"_175":856,"_187":858,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/468","https://api.github.com/repos/pro-collection/interview-question/issues/468/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/468/comments","https://api.github.com/repos/pro-collection/interview-question/issues/468/events","https://github.com/pro-collection/interview-question/issues/468",1775100941,"I_kwDOJGDC6c5pzeQN",468,"前端如何用 canvas 来做电影院选票功能",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[847,848],{"_66":121,"_68":122,"_54":123,"_113":124,"_115":125,"_117":26,"_118":126},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":851,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-06-26T15:55:34Z","2023-06-26T15:55:35Z",{"_169":155,"_170":155,"_171":155},"电影院选票功能可以通过 Canvas 来实现，具体实现步骤如下：\n\n1. 绘制座位图案：使用 Canvas 绘制座位图案，可以用矩形或圆形来表示每个座位，还可以添加不同颜色来表示该座位的状态（已售、已选、可选等）。\n\n2. 添加鼠标事件：添加鼠标事件，如鼠标移动、鼠标单击等，来实现用户交互操作。例如，当用户点击座位时，将该座位的状态改为已选状态，并更新座位图案的颜色。\n\n3. 统计已选座位：在用户选票的过程中，需要统计已选座位的数量和位置，并将选票信息展示给用户。可以通过遍历座位图案数组来实现。\n\n4. 添加检查功能：为了防止用户在选票过程中出现错误，可以添加检查功能，如检查座位是否已被售出或已被其他人选中等。\n\n5. 添加确认和支付功能：当用户选好座位后，需要确认并支付，可以通过弹出确认对话框来实现，并将用户的选票信息发送至后台进行处理。\n\n\n\n**代码实现如下**\n\n```html\n\n\n\n \n Title\n\n\n

\n\n\n\n\n\n\n```\n\n\n",{"_54":857,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/468/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/468/timeline",{"_54":860,"_56":57,"_58":861,"_60":862,"_62":863,"_64":864,"_66":865,"_68":866,"_70":867,"_72":868,"_74":869,"_107":870,"_134":135,"_136":26,"_137":-5,"_138":873,"_140":874,"_162":155,"_156":876,"_158":877,"_161":-5,"_165":166,"_167":878,"_172":-5,"_173":879,"_175":880,"_187":882,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/462","https://api.github.com/repos/pro-collection/interview-question/issues/462/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/462/comments","https://api.github.com/repos/pro-collection/interview-question/issues/462/events","https://github.com/pro-collection/interview-question/issues/462",1757146577,"I_kwDOJGDC6c5ou-3R",462,"斐波拉契数列是什么，用 JS 实现，用尾调优化斐波拉契数列【热度: 923】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[871,872],{"_66":512,"_68":513,"_54":514,"_113":515,"_115":516,"_117":26,"_118":517},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":875,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-06-14T15:18:25Z","2023-06-14T15:18:26Z",{"_169":155,"_170":155,"_171":155},"**关键词**：斐波拉契数列、尾调优化\n\n斐波那契数列是指：0、1、1、2、3、5、8、13、21、34、……，在数学上，斐波那契数列以如下被以递归的方法定义：\n\nF(0) = 0, F(1) = 1\nF(n) = F(n-1) + F(n-2) (n > 1)\n\n用 JS 实现斐波那契数列可以如下：\n\n```\nfunction fibonacci(n) {\n if (n <= 1) {\n return n;\n }\n return fibonacci(n - 1) + fibonacci(n - 2);\n}\n```\n\n这个函数用递归的方式实现了斐波那契数列的求解。但是递归会导致函数栈的不断扩张，当 n 很大的时候会导致栈溢出。所以为了避免这种情况，可以使用尾调用优化。\n\n尾调用优化是指：一个函数的最后一个操作是一个函数调用，并且这个调用的返回值就是这个函数的返回值。这种情况下，函数的调用栈可以被重用，从而避免了栈溢出的问题。\n\n用尾调用优化实现斐波那契数列可以如下：\n\n```\nfunction fibonacci(n, curr = 0, next = 1) {\n if (n === 0) {\n return curr;\n }\n return fibonacci(n - 1, next, curr + next);\n}\n```\n\n这个函数用了 ES6 的默认参数来实现了尾调用优化。由于函数的最后一个操作是对 fibonacci 函数的递归调用，并且这个调用的返回值就是函数的返回值，所以这个递归调用被尾调用优化了。\n",{"_54":881,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/462/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/462/timeline",{"_54":884,"_56":57,"_58":885,"_60":886,"_62":887,"_64":888,"_66":889,"_68":890,"_70":891,"_72":892,"_74":893,"_107":894,"_134":135,"_136":26,"_137":-5,"_138":897,"_140":898,"_162":155,"_156":900,"_158":900,"_161":-5,"_165":166,"_167":901,"_172":-5,"_173":902,"_175":903,"_187":905,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/445","https://api.github.com/repos/pro-collection/interview-question/issues/445/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/445/comments","https://api.github.com/repos/pro-collection/interview-question/issues/445/events","https://github.com/pro-collection/interview-question/issues/445",1753005470,"I_kwDOJGDC6c5ofL2e",445,"执行上下文栈是什么【热度: 632】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[895,896],{"_66":512,"_68":513,"_54":514,"_113":515,"_115":516,"_117":26,"_118":517},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":899,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-06-12T15:24:14Z",{"_169":155,"_170":155,"_171":155},"**关键词**：执行上下文栈\n\n在JavaScript中，执行上下文栈（Execution Context Stack）是用于跟踪和管理函数执行的机制。每当JavaScript代码执行到一个函数时，就会创建一个执行上下文（Execution Context）并被推入执行上下文栈的顶部。当函数执行完毕后，执行上下文将从栈中弹出，控制权将返回给调用该函数的上下文。\n\n执行上下文栈遵循\"先进后出\"（Last-In-First-Out）的原则。也就是说，最后一个推入栈的执行上下文会被最先弹出。\n\n每个执行上下文都包含了以下三个重要的组成部分：\n\n1. 变量对象（Variable Object）：变量对象存储了函数的形参、函数声明、变量声明和作用域链等信息。\n\n2. 作用域链（Scope Chain）：作用域链是一个由当前执行上下文的变量对象和所有父级执行上下文的变量对象组成的链表结构。它用于变量查找的过程。\n\n3. this 值：this 值指定了当前执行上下文中的 this 关键字的指向。\n\n通过执行上下文栈，JavaScript引擎能够追踪到代码的执行位置，并根据当前执行上下文的环境来解析变量和执行函数。这种栈结构的管理方式使得JavaScript能够实现函数的嵌套调用和正确的变量作用域处理。\n",{"_54":904,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/445/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/445/timeline",{"_54":907,"_56":57,"_58":908,"_60":909,"_62":910,"_64":911,"_66":912,"_68":913,"_70":914,"_72":915,"_74":916,"_107":917,"_134":135,"_136":26,"_137":-5,"_138":920,"_140":921,"_162":192,"_156":923,"_158":924,"_161":-5,"_165":166,"_167":925,"_172":-5,"_173":926,"_175":927,"_187":929,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/431","https://api.github.com/repos/pro-collection/interview-question/issues/431/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/431/comments","https://api.github.com/repos/pro-collection/interview-question/issues/431/events","https://github.com/pro-collection/interview-question/issues/431",1748082889,"I_kwDOJGDC6c5oMaDJ",431,"判断数组的方式有哪些【热度: 509】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[918,919],{"_66":512,"_68":513,"_54":514,"_113":515,"_115":516,"_117":26,"_118":517},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":521,"_64":522,"_58":523,"_66":524,"_68":525,"_70":192,"_72":526,"_118":527,"_150":922,"_152":529,"_154":155,"_134":135,"_156":530,"_158":531,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-06-08T14:58:10Z","2024-06-26T10:02:38Z",{"_169":155,"_170":155,"_171":155},"**关键词**：js判断数组方法\n\n在 JavaScript 中，判断一个值是否为数组有多种方式，以下是几种常见的方法：\n\n1. `Array.isArray()`: 使用 `Array.isArray()` 方法可以判断一个值是否为数组。它是 ES5 中新增的方法，返回一个布尔值。\n```javascript\nconst arr = [1, 2, 3];\nconsole.log(Array.isArray(arr)); // true\n\nconst obj = { a: 1, b: 2 };\nconsole.log(Array.isArray(obj)); // false\n```\n\n2. `instanceof` 操作符：可以使用 `instanceof` 操作符检查一个对象是否是特定类的实例。对于数组，可以使用 `instanceof Array` 判断。\n```javascript\nconst arr = [1, 2, 3];\nconsole.log(arr instanceof Array); // true\n\nconst obj = { a: 1, b: 2 };\nconsole.log(obj instanceof Array); // false\n```\n\n3. `Array.prototype.isArray()`：可以通过 `Array.prototype.isArray.call()` 方法来判断一个值是否为数组。这种方式在某些特定情况下使用较多。\n```javascript\nconst arr = [1, 2, 3];\nconsole.log(Array.prototype.isArray.call(arr)); // true\n\nconst obj = { a: 1, b: 2 };\nconsole.log(Array.prototype.isArray.call(obj)); // false\n```\n\n4. `Object.prototype.toString()`：可以使用 `Object.prototype.toString.call()` 方法来获取一个值的类型信息，进而判断是否为数组。返回的结果是一个包含类型信息的字符串，例如 \"[object Array]\"。\n```javascript\nconst arr = [1, 2, 3];\nconsole.log(Object.prototype.toString.call(arr) === \"[object Array]\"); // true\n\nconst obj = { a: 1, b: 2 };\nconsole.log(Object.prototype.toString.call(obj) === \"[object Array]\"); // false\n```\n\n这些方法各有特点，根据实际需求选择合适的方法进行判断。通常推荐使用 `Array.isArray()` 方法来判断一个值是否为数组，因为它是专门用于判断数组的标准方法，并且在大多数现代浏览器中得到广泛支持。\n",{"_54":928,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/431/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/431/timeline",{"_54":931,"_56":57,"_58":932,"_60":933,"_62":934,"_64":935,"_66":936,"_68":937,"_70":938,"_72":939,"_74":940,"_107":941,"_134":135,"_136":26,"_137":-5,"_138":944,"_140":945,"_162":155,"_156":947,"_158":948,"_161":-5,"_165":166,"_167":949,"_172":-5,"_173":950,"_175":951,"_187":953,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/408","https://api.github.com/repos/pro-collection/interview-question/issues/408/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/408/comments","https://api.github.com/repos/pro-collection/interview-question/issues/408/events","https://github.com/pro-collection/interview-question/issues/408",1740393524,"I_kwDOJGDC6c5nvEw0",408,"token过期后，页面如何实现无感刷新【热度: 485】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[942,943],{"_66":110,"_68":111,"_54":112,"_113":114,"_115":116,"_117":26,"_118":119},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":142,"_64":143,"_58":144,"_66":145,"_68":146,"_70":147,"_72":148,"_118":149,"_150":946,"_152":153,"_154":155,"_134":135,"_156":157,"_158":159,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-06-04T14:05:08Z","2023-06-04T14:05:09Z",{"_169":155,"_170":155,"_171":155},"**关键词**：token过期刷新、token刷新\n\n当 token 过期后，实现无感刷新页面的一种常见方式是使用刷新 token 的机制。下面是一个基本的实现思路：\n\n1. 在前端应用中，使用某种方式（例如 Cookie、Local Storage）存储 token。\n2. 在每次发起请求时，通过拦截器或者请求中间件检查 token 是否过期。\n3. 如果 token 过期，前端会收到一个特定的响应（例如 HTTP 状态码 401 Unauthorized）。\n4. 前端通过监听该特定的响应，触发刷新 token 的操作。\n5. 刷新 token 的操作可以是发送一个特定的请求到后端，后端验证并颁发新的 token。\n6. 在 token 刷新成功后，前端更新存储的 token，并重新发起之前的请求，确保请求的无感刷新。\n\n需要注意的是，具体的实现可能会因框架和后端 API 的不同而有所差异。上述步骤提供了一个基本的思路，你可以根据实际需求和使用的技术栈进行调整和扩展。\n\n",{"_54":952,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/408/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/408/timeline",{"_54":955,"_56":57,"_58":956,"_60":957,"_62":958,"_64":959,"_66":960,"_68":961,"_70":962,"_72":963,"_74":964,"_107":965,"_134":135,"_136":26,"_137":-5,"_138":968,"_140":969,"_162":155,"_156":971,"_158":972,"_161":-5,"_165":166,"_167":973,"_172":-5,"_173":974,"_175":975,"_187":977,"_189":-5,"_190":-5,"_191":192},"https://api.github.com/repos/pro-collection/interview-question/issues/394","https://api.github.com/repos/pro-collection/interview-question/issues/394/labels{/name}","https://api.github.com/repos/pro-collection/interview-question/issues/394/comments","https://api.github.com/repos/pro-collection/interview-question/issues/394/events","https://github.com/pro-collection/interview-question/issues/394",1734491919,"I_kwDOJGDC6c5nYj8P",394,"[webpack] 提高 webpack 的构建速度的办法有哪些【热度: 1,208】",{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},[966,967],{"_66":259,"_68":260,"_54":261,"_113":262,"_115":263,"_117":26,"_118":264},{"_66":128,"_68":129,"_54":130,"_113":131,"_115":132,"_117":26,"_118":133},[],{"_54":268,"_64":269,"_58":270,"_66":271,"_68":272,"_70":273,"_72":274,"_118":275,"_150":970,"_152":277,"_154":155,"_134":135,"_156":278,"_158":279,"_160":-5,"_161":-5},{"_76":77,"_66":78,"_68":79,"_80":81,"_82":23,"_54":83,"_64":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_62":99,"_100":101,"_102":103,"_104":105,"_106":26},"2023-05-31T15:30:28Z","2023-11-01T15:01:44Z",{"_169":155,"_170":155,"_171":155},"**关键词**：webpack 构建、webpack 构建优化、webpack 构建速度\n\n以下是一些可以提高Webpack构建速度的办法：\n\n1. 使用更快的构建工具：升级Webpack到最新版本，因为每个新版本通常都会带来性能改进和优化。\n \n2. 减少文件的数量：通过代码拆分和按需加载等技术，将代码拆分成更小的模块，减少每次构建需要处理的文件数量。\n \n3. 使用缓存：启用Webpack的缓存功能，可以在多次构建过程中复用已经构建好的模块，从而减少重新构建的时间。\n \n4. 使用多线程/多进程构建：通过使用工具如HappyPack或thread-loader等，可以将Webpack的构建过程并行化，利用多线程或多进程来加速构建速度。\n \n5. 优化Loader配置：确保Loader的配置尽可能精确，只对需要处理的文件进行操作，并且使用高效的Loader插件。避免不必要的文件处理和转换，以提高构建速度。\n\n6. 使用DLL和缓存组：使用Webpack的DLLPlugin和CacheGroups等功能，可以将一些稳定不变的依赖提前编译和缓存，减少每次构建的时间。\n\n7. 压缩输出文件：使用Webpack的压缩插件（如UglifyJsPlugin）对输出文件进行压缩和混淆，减小文件大小，加快加载速度。\n\n8. 配置resolve.extensions：通过配置Webpack的resolve.extensions，明确指定需要处理的文件类型，避免Webpack进行多余的文件扫描和匹配。\n\n9. 开启持久化缓存：使用Webpack的持久化缓存插件（如HardSourceWebpackPlugin），将构建过程中的中间结果缓存到硬盘中，提高后续构建的速度。\n\n10. 使用Tree Shaking：利用Webpack的Tree Shaking特性，移除未使用的代码，减小输出文件的体积，加快加载速度。\n\n这些是提高Webpack构建速度的一些常见方法，可以根据具体项目的需求和情况选择适合的优化策略。同时，不同的项目和环境可能会有不同的性能瓶颈，因此需要根据实际情况进行具体的优化和调整。\n\n",{"_54":976,"_178":155,"_179":155,"_180":155,"_181":155,"_182":155,"_183":155,"_184":155,"_185":155,"_186":155},"https://api.github.com/repos/pro-collection/interview-question/issues/394/reactions","https://api.github.com/repos/pro-collection/interview-question/issues/394/timeline","pagination",{"_980":155,"_169":147},"value","actionData","errors"]