feat: change dir

docs/interview/experiences/10Array.md

@@ -2,8 +2,8 @@
 title: 0310积累面试经验之Array相关
 order: 10
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/12interview0703.md

@@ -2,8 +2,8 @@
 title: 0703面试积累
 order: 12
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'
@@ -271,6 +271,11 @@ abcdefg;
 
 - 各种缓存的优先级, memory disk http2 push?
 - 小程序为什么会有两个线程? 怎么设计?
+
+```js
+
+```
+
 - xss? 如何防范?
 
 - 多叉树, 获取每一层的节点之和

docs/interview/experiences/1acc0310.md

@@ -2,8 +2,8 @@
 title: 0310积累面试经验之base相关
 order: 1
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/28acc1130.md

@@ -2,8 +2,8 @@
 title: 1130积累面试
 order: 26
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/29acc1201.md

@@ -2,8 +2,8 @@
 title: 1201积累面试
 order: 29
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/2baseWriting.md

@@ -1,8 +1,8 @@
 ---
 title: 面试经验之手写js基础版
-order: 2
+order: 13
 group:
-  order: 0
+  order: 11
   title: interview
 nav:
   order: 3
@@ -52,8 +52,9 @@ Array.prototype.mockMap = function (fn, context) {
 Array.prototype.myReduce = function (fn, init) {
   var arr = Array.prototype.slice.call(this) || [];
   var res = init ? init : arr[0];
-  for (let i = init ? 0 : 1; i < arr.length; i++) {
-    res = fn.call(null, res, arr[i], i, arr);
+  let startIndex = init ? 0 : 1;
+  for (let startIndex; startIndex < arr.length; startIndex++) {
+    res = fn.call(null, res, arr[startIndex], startIndex, arr);
   }
   return res;
 };
@@ -66,33 +67,36 @@ console.log(sum2, 'sum');
 ### myFlat
 
 ```js
-Array.prototype.myFlat = function (num = 1) {
+Array.prototype.myFlat = function (depth = 1) {
   var arr = Array.prototype.slice.call(this) || [];
   var i = 0;
   while (arr.some((e) => Array.isArray(e))) {
-    console.log(arr, 'before');
     arr = [].concat(...arr);
-    console.log(arr, 'after');
     i++;
-    if (i >= num) break;
+    if (i >= depth) break;
   }
+  console.log(arr, 'arr');
   return arr;
 };
 var test = [1, [2, 3, 4], [[5, 6, 7]]];
+test.myFlat(2);
 
-Array.prototype.myFlatten2 = function () {
+Array.prototype.myFlatten2 = function (depth = 1) {
   var arr = Array.prototype.slice.call(this) || [];
   var stack = [...arr];
   var res = [];
+  let i = 0;
   while (stack.length) {
     var cur = stack.pop();
-    if (Array.isArray(cur)) {
+    if (Array.isArray(cur) && i <= depth) {
+      i++;
       stack.push(...cur);
     } else {
       res.push(cur);
     }
   }
   return res;
 };
-test.myFlat();
+var test = [1, [2, 3, 4], [[5, 6, 7]]];
+test.myFlatten2(2);
 ```

docs/interview/experiences/31acc20231207.md

@@ -2,8 +2,8 @@
 title: 1207积累面试
 order: 31
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/32interview2023.md

@@ -2,8 +2,8 @@
 title: 1208面试小记
 order: 31
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/33acc20240116.md

@@ -2,8 +2,8 @@
 title: 20240116积累面试
 order: 33
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/34acc20240312.md

@@ -2,8 +2,8 @@
 title: 20240312积累面试
 order: 34
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/35acc20240314.md

@@ -2,8 +2,8 @@
 title: 20240314积累面试
 order: 35
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/36acc20240322.md

@@ -2,8 +2,8 @@
 title: 20240322积累面试
 order: 36
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/37acc20240326.md

@@ -2,8 +2,8 @@
 title: 20240326积累面试
 order: 37
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/3baseLogic.md

@@ -1,9 +1,9 @@
 ---
 title: 面试经验之手写算法基础版
-order: 3
+order: 14
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'
@@ -14,14 +14,14 @@ nav:
 
 - LRU 缓存淘汰策略
 - 二分法
-- 3. 无重复字符的最长子串
+- 无重复字符的最长子串
 - 反转链表
 - 删除链表一个节点
 - 链表是否有环
 - 链表如果有环的话返回入口节点
 - 无重复字符的最长子串
 - 盛最多水的容器
-- 20. 有效的括号
+- 有效的括号
 - 全排列
 - 前中后序遍历
 - 二叉树层序遍历

docs/interview/experiences/4beforeHandwriting.md

@@ -2,8 +2,8 @@
 title: 面试经验之手写之历史汇总
 order: 4
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/5middleWriting.md

@@ -2,8 +2,8 @@
 title: 面试经验之手写js中阶版
 order: 5
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'
@@ -178,6 +178,24 @@ rgbToHex(`rgb(255, 255, 255)`);
 
 ## 手写 es6 中的 class
 
+```js
+function mockClass(con, proto, staticProps) {
+  proto && defineProperties(con.prototype, proto);
+  staticProps && defineProperties(con, staticProps);
+  return con;
+}
+function defineProperties(target, obj) {
+  for (let key in obj) {
+    Object.defineProperty(target, key, {
+      value: obj[key],
+      writable: true,
+      enumerable: false,
+      configurable: true,
+    });
+  }
+}
+```
+
 ## 手写 es6 中的 extends
 
 1.类的属性和方法以及原型上的属性和方法需要继承 2.类的静态属性和方法需要子类继承

docs/interview/experiences/6acc0213.md

@@ -2,8 +2,8 @@
 title: 0214积累面试经验
 order: 6
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/7acc0307.md

@@ -2,8 +2,8 @@
 title: 0306积累面试经验之高阶函数
 order: 7
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/8acc1230.md

@@ -2,8 +2,8 @@
 title: 1230面试经验
 order: 8
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'

docs/interview/experiences/9acc0601.md

@@ -2,8 +2,8 @@
 title: 0601积累面试经验
 order: 9
 group:
-  order: 0
-  title: interview
+  order: 11
+  title: /interview/experience
 nav:
   order: 3
   title: 'interview'