feat: 新增算法文档

Author: Chu Fan

code/algorithm/剑指/动态规划/fibonacci.js

@@ -3,7 +3,6 @@
  * 难度：入门
  * @param n
  * @returns {*}
- * @constructor
  */
 function fibonacciOne(n) {
   return n < 2 ? n : fibonacciOne(n - 1) + fibonacciOne(n - 2)
@@ -21,9 +20,7 @@ function fibonacciTwo(n) {
 
   let result = 1
   for (let index = 3; index <= n; index++) {
-    // 求和
     result = firstValue + secondValue
-
     // 前面两列重新赋值
     firstValue = secondValue
     secondValue = result

code/algorithm/剑指/双指针/FindNumbersWithSum.js

@@ -0,0 +1,107 @@
+/*
+ * @Description: 【中等】和为S的两个数字
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2021-04-30 20:29:08
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2021-04-30 21:04:46
+ */
+
+
+/**
+ * 利用双指针
+ * @param array
+ * @param sum
+ * @returns {*[]}
+ */
+function findNumbersWithSumOne(array, sum) {
+  let left = 0; let right = array.length - 1
+  while (left < right) {
+    if (array[left] + array[right] === sum) {
+      // 第一个就返回
+      return [array[left], array[right]]
+    } else if (array[left] + array[right] > sum) {
+      // 向左逼近
+      right--
+    } else {
+      // 向右逼近
+      left++
+    }
+  }
+  return []
+}
+
+/**
+ * 注意数组array是递增的
+ * 利用二分查找
+ * @param array
+ * @param sum
+ * @returns {*[]}
+ */
+function findNumbersWithSumTwo(array, sum) {
+  let left = 0
+  let right = array.length - 1
+  // 将最小值标记设置成最大
+  let min = array[right] * array[right]
+  let result = []
+  while (left < right) {
+    if (array[left] + array[right] === sum) {
+      // 符合条件
+      if (min > array[left] * array[right]) {
+        // 最小值
+        min = array[left] * array[right]
+        result = [array[left], array[right]]
+      }
+      left++
+      right--
+    } else if (array[left] + array[right] < sum) {
+      // 左边向右逼近
+      left++
+    } else {
+      // 右边向左逼近
+      right--
+    }
+  }
+  return result
+}
+
+/**
+ * 利用map来存放数据，便于查找
+ * @param array
+ * @param sum
+ */
+function findNumbersWithSumThree(array, sum) {
+  const resultMap = new Map()
+  for (const a of array) {
+    resultMap.set(a, true)
+  }
+  for (const a of array) {
+    if (resultMap.has(sum - a)) {
+      return [a, sum - a]
+    }
+  }
+  return []
+}
+
+/**
+ * 暴力方案
+ * @param array
+ * @param sum
+ */
+function findNumbersWithSumFour(array, sum) {
+  const len = array.length
+  for (let index = 0; index < len; index++) {
+    const firstValue = array[index]
+    for (let j = index + 1; j < len; j++) {
+      if (array[j] === sum - firstValue) {
+        return [firstValue, array[j]]
+      }
+    }
+  }
+  return []
+}
+
+console.log(findNumbersWithSumOne([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], 21))
+console.log(findNumbersWithSumTwo([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], 21))
+console.log(findNumbersWithSumThree([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], 21))
+console.log(findNumbersWithSumFour([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], 21))

…gorithm/剑指/双指针/FindContinuousSequence.js …gorithm/剑指/双指针/findContinuousSequence.jscode/algorithm/剑指/双指针/FindContinuousSequence.js renamed to code/algorithm/剑指/双指针/findContinuousSequence.js code/algorithm/剑指/双指针/FindContinuousSequence.js renamed to code/algorithm/剑指/双指针/findContinuousSequence.js

@@ -1,32 +1,31 @@
 export const soloAlgorithmSidebar = [
-  {
-    text: '面试必须刷101',
-    link: 'interview-101'
-  },
-  {
-    text: '剑指Offer',
-    link: 'sword-point'
-  },
-  {
-    text: 'Shell篇',
-    link: 'shell/'
-  },
-  {
-    text: '在线刷题',
-    children: [
-
-      {
-        text: '牛客网',
-        link: 'https://www.nowcoder.com/'
-      },
-      {
-        text: 'LeetCode',
-        link: 'https://leetcode-cn.com/'
-      },
-      {
-        text: '杭电OJ',
-        link: 'http://acm.hdu.edu.cn/'
-      }
-    ]
-  }
+    {
+        text: '面试必须刷101',
+        link: 'interview-101'
+    },
+    {
+        text: '剑指Offer',
+        link: 'sword-point'
+    },
+    {
+        text: 'Shell篇',
+        link: 'shell'
+    },
+    {
+        text: '在线刷题',
+        children: [
+            {
+                text: '牛客网',
+                link: 'https://www.nowcoder.com/'
+            },
+            {
+                text: 'LeetCode',
+                link: 'https://leetcode-cn.com/'
+            },
+            {
+                text: '杭电OJ',
+                link: 'http://acm.hdu.edu.cn/'
+            }
+        ]
+    }
 ]

code/algorithm/剑指/双指针/findNumbersWithSum.js

@@ -10,7 +10,7 @@
  - [x] [【简单】数组中重复的数字](数组和矩阵/duplicate.md)
  - [x] [【中等】二维数组中的查找](数组和矩阵/find.md)
  - [x] [【简单】替换空格](数组和矩阵/replaceSpace.md)
- - [ ] [【较难】顺时针打印矩阵](数组和矩阵/printMatrix.md)
+ - [x] [【较难】顺时针打印矩阵](数组和矩阵/printMatrix.md)
  - [x] [【简单】第一个只出现一次的字符位置](数组和矩阵/firstNotRepeatingChar.md)
 
 
@@ -28,7 +28,7 @@
 
 ### 双指针
 
-- [ ] [【中等】和为S的两个数字](双指针/findNumbersWithSum.md)
+- [x] [【中等】和为S的两个数字](双指针/findNumbersWithSum.md)
 - [ ] [【中等】和为S的连续正数序列](双指针/findContinuousSequence.md)
 - [ ] [【中等】左旋转字符串](双指针/leftRotateString.md)
 - [ ] [【较难】翻转单词顺序列](双指针/reverseSentence.md)