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,
 }