fix: 修复文档、代码的Eslint校验错误 (#154)

* fix: 修复文档、代码的Eslint校验错误

* chore: update

---------

Co-authored-by: chufan <mmdapl@163.com>

Author: 微信公众号：储凡

README.md

@@ -368,7 +368,7 @@ Nuxt.js是在vue框架上进行封装的，主要是用来解决单体页面的
 
 - [ ] nodejs下gRPC的简单实用
 - [ ] gRPC集成express框架
-- [ ] gRPC集成koa框架
+- [ ] gRPC集成Koa框架
 - [ ] gRPC在egg.js下的应用
 - [ ] gRPC插件开发示例
 

code/algorithm/debounce.js

@@ -9,6 +9,7 @@ function debounce(func, time) {
     clearTimeout(timeout)
     timeout = setTimeout(() => {
       // 执行函数
+      // eslint-disable-next-line prefer-rest-params
       func.apply(this, arguments)
       // func()
     }, time)

code/algorithm/deepClone.js

@@ -8,9 +8,6 @@ function DeepCloneByJSON(target) {
 
 /**
  * 基于递归思想的深拷贝
- * @param target
- * @returns {{}|*}
- * @constructor
  */
 function DeepClone(target) {
   let result
@@ -41,3 +38,7 @@ function checkType(target) {
   // typeof -instanceof -toString.call()  -Array.isArray()
   return Object.prototype.toString.call(target).slice(8, -1)
 }
+
+// 深拷贝
+console.log(DeepCloneByJSON)
+console.log(DeepClone)

code/algorithm/front-end-ts/add.js

@@ -2,9 +2,12 @@
  * 累加
  */
 function add() {
+  // eslint-disable-next-line prefer-rest-params
   const args = Array.prototype.slice.call(arguments)
   const _add = function () {
+    // eslint-disable-next-line prefer-rest-params
     console.log('add', arguments)
+    // eslint-disable-next-line prefer-rest-params
     args.push(...arguments)
 
     // 返回函数

code/algorithm/front-end/duplicates.js

@@ -1,7 +1,5 @@
 /**
  * 找出数组 arr 中重复出现过的元素
- * @param arr
- * @returns {*[]}
  */
 function duplicates(arr) {
   const sortArr = arr.sort()

code/algorithm/interview-101/addInList.js

@@ -11,8 +11,9 @@
  * @return ListNode类
  */
 function addInList(head1, head2) {
-  // write code here
+  console.log(head1, head2)
 }
+
 module.exports = {
   addInList,
 }

code/algorithm/interview-101/binarySearch.js

@@ -19,7 +19,8 @@ const search = function (nums, target) {
  * @param target
  */
 function binarySearch(nums, target) {
-  let left = 0; let right = nums.length
+  let left = 0
+  let right = nums.length
   while (left < right) {
     // 注意js取整问题；
     const mid = left + Number.parseInt((right - left) / 2)
@@ -45,7 +46,8 @@ function binarySearch(nums, target) {
  * @param target
  */
 function leftBound(nums, target) {
-  let left = 0; let right = nums.length - 1
+  let left = 0
+  let right = nums.length - 1
 
   // [left,right]
   while (left <= right) {
@@ -74,7 +76,9 @@ function leftBound(nums, target) {
  * @param target
  */
 function rightBound(nums, target) {
-  let left = 0; let right = nums.length
+  let left = 0
+  let right = nums.length
+
   // [left,right) 情况
   while (left < right) {
     const mid = left + Math.floor((right - left) / 2)
@@ -97,9 +101,8 @@ function rightBound(nums, target) {
   return nums[left - 1] === target ? left - 1 : -1
 }
 
-// console.log(search([-1,0,3,5,9,12],9))
-
-// console.log(search([5,7,7,8,8,8,10],8))
-
-// console.log(left_bound([5,7,7,8,8,8,10],8))
-console.log(rightBound([5, 7, 7, 8, 8, 8, 10], 8))
+const nums = [5, 7, 7, 8, 8, 8, 10]
+const target = 8
+console.log(search(nums, target))
+console.log(leftBound(nums, target))
+console.log(rightBound(nums, target))

code/algorithm/interview-101/deleteDuplicates-1.js

@@ -10,5 +10,8 @@
  * @return ListNode类
  */
 function deleteDuplicatesOne(head) {
-  // write code here
+  console.log(head)
 }
+
+// 测试用例
+console.log(deleteDuplicatesOne(1))

code/algorithm/interview-101/deleteDuplicates-2.js

@@ -10,5 +10,8 @@
  * @return ListNode类
  */
 function deleteDuplicatesTwo(head) {
-  // write code here
+  console.log(head)
 }
+
+// 测试用例
+console.log(deleteDuplicatesTwo(1))

code/algorithm/interview-101/entryNodeOfLoop.js

@@ -9,8 +9,9 @@
  * @constructor
  */
 function entryNodeOfLoop(pHead) {
-  // write code here
+  console.log(pHead)
 }
+
 module.exports = {
   entryNodeOfLoop,
 }

code/algorithm/interview-101/fibonacci.js

@@ -18,12 +18,14 @@ function fibonacciTwo(n) {
   let secondValue = 1
 
   let result = 1
+
   for (let index = 3; index <= n; index++) {
     result = firstValue + secondValue
     // 前面两列重新赋值
     firstValue = secondValue
     secondValue = result
   }
+
   return result
 }
 

code/algorithm/interview-101/findContinuousSequence.js

@@ -1,9 +1,11 @@
 // 指针矛盾了
 function FindContinuousSequence(sum) {
   // 首先，序列最少包含两位数，则 x+(x+1)<=sum ===> x<sum/2 暂且向上取整吧
-  let left = 1; const right = 2
+  let left = 1
+  const right = 2
   let tempSum = 3
   const result = []
+
   // < 确保序列不断，跳出玄幻时候，left ==right
   while (left < right) {
     // 求和

code/algorithm/interview-101/findFirstCommonNode.js

@@ -10,8 +10,9 @@
  * @constructor
  */
 function findFirstCommonNode(pHead1, pHead2) {
-  // write code here
+  console.log(pHead1, pHead2)
 }
+
 module.exports = {
   findFirstCommonNode,
 }

code/algorithm/interview-101/findKth.js

@@ -51,6 +51,7 @@ function getPivot(arr, low, high) {
     arr[high] = arr[low]
   }
   arr[low] = pivot
+
   return low
 }
 

code/algorithm/interview-101/findKthToTail.js

@@ -1,10 +1,12 @@
 /**
  * 链表结点
  */
+// eslint-disable-next-line no-unused-vars,unused-imports/no-unused-vars
 function ListNode(x) {
   this.val = x
   this.next = null
 }
+
 /**
  *【简单】 链表中倒数最后k个结点
  * @param pHead ListNode类

code/algorithm/interview-101/findNumbersWithSum.js

@@ -17,11 +17,13 @@ function FindNumbersWithSum(array, sum) {
       // 向右
       left++
     }
-    else if (tempSum > sum) {
+
+    if (tempSum > sum) {
       // 向左
       right--
     }
-    else if (tempSum === sum) {
+
+    if (tempSum === sum) {
       // 已找到符合条件的元素，需要对齐进行乘积比较
       if (min > array[left] * array[right]) {
         // 假定为最小值
@@ -34,6 +36,7 @@ function FindNumbersWithSum(array, sum) {
       right--
     }
   }
+
   // left===right 退出
   return sumResult
 }

code/algorithm/interview-101/getLongestPalindrome.js

@@ -22,3 +22,6 @@ function getLongestPalindrome(str, len) {
   }
   return max
 }
+
+// 测试用例
+console.log(getLongestPalindrome('sbcc', 2))

code/algorithm/interview-101/hasCycle.js

@@ -4,8 +4,9 @@
  * @return bool布尔型
  */
 function hasCycle(head) {
-  // write code here
+  console.log(head)
 }
+
 module.exports = {
   hasCycle,
 }

code/algorithm/interview-101/isPail.js

@@ -10,8 +10,9 @@
  * @return bool布尔型
  */
 function isPail(head) {
-  // write code here
+  console.log(head)
 }
+
 module.exports = {
   isPail,
 }

code/algorithm/interview-101/merge.js

@@ -4,8 +4,9 @@
  * @return ListNode类
  */
 function merge(pHead1, pHead2) {
-  // write code here
+  console.log(pHead1, pHead2)
 }
+
 module.exports = {
   merge,
 }

code/algorithm/interview-101/mergeLists.js

@@ -4,8 +4,9 @@
  * @return ListNode类
  */
 function mergeKLists(lists) {
-
+  console.log(lists)
 }
+
 module.exports = {
   mergeKLists,
 }

code/algorithm/interview-101/moreThanHalfNum.js

@@ -1,3 +1,9 @@
+/**
+ *
+ * @param numbers
+ * @returns {number}
+ * @constructor
+ */
 function MoreThanHalfNumSolution(numbers) {
   const map = new Map()
   numbers.forEach((item) => {
@@ -17,3 +23,6 @@ function MoreThanHalfNumSolution(numbers) {
   })
   return result
 }
+
+// 测试用例
+console.log(MoreThanHalfNumSolution(11))

code/algorithm/interview-101/oddEvenList.js

@@ -1,17 +1,23 @@
-/*
- * function ListNode(x){
- *   this.val = x;
- *   this.next = null;
- * }
+/**
+ * 结点
+ * @param x
+ * @constructor
  */
+// eslint-disable-next-line no-unused-vars,unused-imports/no-unused-vars
+function ListNode(x) {
+  this.val = x
+  this.next = null
+}
+
 /**
  *
  * @param head ListNode类
  * @return ListNode类
  */
 function oddEvenList(head) {
-  // write code here
+  console.log(head)
 }
+
 module.exports = {
   oddEvenList,
 }

code/algorithm/interview-101/reverseGroup.js

@@ -4,5 +4,8 @@
  * @return ListNode类
  */
 function reverseGroup(head, k) {
-  // write code here
+  console.log(head, k)
 }
+
+// 测试用例
+console.log(reverseGroup(11, 11))

code/algorithm/interview-101/reverseList.js

@@ -3,8 +3,9 @@
     this.next = null;
 } */
 function reverseList(pHead) {
-  // write code here
+  console.log(pHead)
 }
+
 module.exports = {
   reverseList,
 }

code/algorithm/interview-101/sortInList.js

@@ -9,8 +9,9 @@
  * @return ListNode类
  */
 function sortInList(head) {
-  // write code here
+  console.log(head)
 }
+
 module.exports = {
   sortInList,
 }

code/algorithm/interview-101/threeNum.js

@@ -11,14 +11,15 @@ function threeSum(num) {
     // 查找左边
     for (let left = 0; left < mid; left++) {
       // 查找右边
-
       for (let right = mid + 1; right < len; right++) {
         if (num[left] + num[mid] + num[right] === 0) {
           result.push([num[left], num[mid], num[right]])
         }
       }
     }
   }
+
   return result
 }
+
 console.log(threeSum([-2, 0, 1, 1, 2]))

code/algorithm/interview-101/twoSum.js

@@ -32,7 +32,6 @@ function twoSumByMap(numbers, target) {
     if (map.has(target - numbers[left]) && map.get(target - numbers[left]) !== (left + 1)) {
       // 则在左边找到元素
       const right = map.get(target - numbers[left])
-      console.log(map)
       return [right, left + 1]
     }
     // 有点倒排索引的意思