From 28d2ddfdc0c35e2c2b66fa2bd8287f1b4897796e Mon Sep 17 00:00:00 2001
From: mmdapl <2237221210@qq.com>
Date: Sun, 25 Apr 2021 07:37:39 +0800
Subject: [PATCH] =?UTF-8?q?[4.25=20=E6=9B=B4=E6=96=B0=E5=89=8D=E7=AB=AF?=
 =?UTF-8?q?=E9=83=A8=E5=88=86=E7=AE=97=E6=B3=95]?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 README.md                      |   6 ++---
 算法/.DS_Store                 | Bin 6148 -> 6148 bytes
 算法/前端/add.js               |  46 +++++++++++++++++++++++++++++++++
 算法/前端/count.js             |  31 ++++++++++++++++++++++
 算法/前端/duplicates.js        |  30 +++++++++++++++++++++
 算法/前端/isUSD.js             |  46 +++++++++++++++++++++++++++++++++
 算法/前端/removeWithoutCopy.js |  44 +++++++++++++++++++++++++++++++
 7 files changed, 200 insertions(+), 3 deletions(-)
 create mode 100644 算法/前端/add.js
 create mode 100644 算法/前端/count.js
 create mode 100644 算法/前端/duplicates.js
 create mode 100644 算法/前端/isUSD.js
 create mode 100644 算法/前端/removeWithoutCopy.js

diff --git a/README.md b/README.md
index 1e9e2cd..cb43673 100644
--- a/README.md
+++ b/README.md
@@ -265,7 +265,7 @@
 
 
 <div align="left">
-<img src="https://s3.ax1x.com/2021/03/13/6wdNy4.jpg" width="300" height="300" style="border-radius:5px;" />
+<img src="https://cdn.jsdelivr.net/gh/lir0115/images@main/qr_code/wechat_donate.png" width="300" height="300" style="border-radius:5px;" />
 
 
 </div>
@@ -277,7 +277,7 @@
 有任何问题或建议，欢迎微信`骚扰`，商务合作请备注！
 
 <div align="left">
-<img src="https://s3.ax1x.com/2021/03/13/6wdDFx.jpg" width="300" height="300"  style="border-radius:5px;"/>
+<img src="https://cdn.jsdelivr.net/gh/lir0115/images@main/qr_code/wechat_code.jpg" width="300" height="300"  style="border-radius:5px;"/>
 </div>
 
 
@@ -315,7 +315,7 @@
 
 
 <p>
-  <img src="https://cdn.jsdelivr.net/gh/lir0115/images@main/gongzhonghao.jpg"  style="border-radius:10px;">
+  <img src="https://cdn.jsdelivr.net/gh/lir0115/images@main/qr_code/gongzhonghao.jpg"  style="border-radius:10px;">
 </p>
 
 
diff --git a/算法/.DS_Store b/算法/.DS_Store
index b969473b5537309019f055a5638fa08310e22f32..62b48ce1261724a9f79e275f21acde55981b9890 100644
GIT binary patch
delta 91
zcmZoMXfc=|#>B!ku~2NHo+2ar#(>?7iyN4k7}+QDFljRTR=uAb!*r7$NS6f{<>ln(
sr86)vFm5(rdd{?&or9kPsC9E8^LOUS{34DVj0_A+Kxu}}5h81t0k5+dAOHXW

delta 67
zcmZoMXfc=|#>B)qu~2NHo+2ab#(>?7jI5J+STr}QvOZ$k*zkdAGdl-A2T;joL5}at
Vlles)IT(O|k%56_bA-qmW&l+45DNeR

diff --git a/算法/前端/add.js b/算法/前端/add.js
new file mode 100644
index 0000000..60b11b8
--- /dev/null
+++ b/算法/前端/add.js
@@ -0,0 +1,46 @@
+/*
+ * @Description: 
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2021-04-23 07:50:21
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2021-04-23 22:05:34
+ */
+
+
+
+function add(){
+  console.log(arguments);
+  var args=Array.prototype.slice.call(arguments)
+  console.log(args)
+
+
+  var _add=function(){
+    console.log('add',arguments)
+    args.push(...arguments);
+
+    // 返回函数
+    return _add;
+  }
+
+  console.log(args)
+
+  // 对参数数组做求和处理
+
+  _add.toString=function(){
+    // 设置sum的起始值为0
+    return args.reduce((sum,item)=>{
+      console.log(sum,item)
+      return sum+item;
+    })
+  }
+  // 返回函数
+  return _add
+}
+
+let str=add(1,6)(2)(3)
+console.log(str)
+// console.log(String(add(1,6)(2)(3)) )
+// console.log(add(1)(2)(3))
+// console.log(add(1)(2,3,4))
+
diff --git a/算法/前端/count.js b/算法/前端/count.js
new file mode 100644
index 0000000..130b82d
--- /dev/null
+++ b/算法/前端/count.js
@@ -0,0 +1,31 @@
+/*
+ * @Description: 字符串中字符出现频率计数
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2021-04-14 10:21:39
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2021-04-14 10:22:19
+ */
+
+
+function count(str) {
+  // 转换为数组后去重
+  const originArr=str.split('')
+  const arr=[...new Set(originArr)];
+  let result={};
+  for(let index=0;index<arr.length;index++){
+      const value=arr[index];
+      let count=0;
+      if(value!==' '){
+        originArr.map(item=>{
+              if(item===value){
+                  count++
+              }
+          })
+          // 对象计数
+          result[value]=count
+      }
+
+  }
+  return result;
+}
\ No newline at end of file
diff --git a/算法/前端/duplicates.js b/算法/前端/duplicates.js
new file mode 100644
index 0000000..c6a6700
--- /dev/null
+++ b/算法/前端/duplicates.js
@@ -0,0 +1,30 @@
+/*
+ * @Description: 找出数组 arr 中重复出现过的元素
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2021-04-14 10:22:51
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2021-04-14 10:22:51
+ */
+
+
+// 找出数组 arr 中重复出现过的元素
+function duplicates(arr) {
+  const sortArr=arr.sort();
+
+  let result=new Array()
+
+  const len=sortArr.length;
+
+  for(let index=0;index<len-1;index++){
+
+    if(sortArr[index]===sortArr[index++]){
+      result.push(sortArr[index])
+    }
+  }
+
+  // 去重
+  return [...new Set(result)];
+}
+
+console.log(duplicates([1, 2, 4, 4, 3, 3, 1, 5, 3]))
diff --git a/算法/前端/isUSD.js b/算法/前端/isUSD.js
new file mode 100644
index 0000000..4e75ccd
--- /dev/null
+++ b/算法/前端/isUSD.js
@@ -0,0 +1,46 @@
+/*
+ * @Description: 
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2021-04-21 07:15:31
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2021-04-21 12:01:57
+ */
+
+
+function isUSD (str) {
+
+  if (!str.startsWith('$')) {
+    return false;
+  }
+
+  if (str.indexOf('.')) {
+    // 小数
+    let arr = str.split('.');
+
+    if (arr[1].length !== 2) {
+      return false;
+    };
+
+    let strArr = arr[0].split(',');
+
+    for (let index = 0; index < strArr.length; index++) {
+      if (strArr[index].length !== 3) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  let strArr = str.split(',');
+
+  for (let index = 0; index < strArr.length; index++) {
+    if (strArr[index].length !== 3) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+console.log(isUSD('$20,933,209.93'))
\ No newline at end of file
diff --git a/算法/前端/removeWithoutCopy.js b/算法/前端/removeWithoutCopy.js
new file mode 100644
index 0000000..1cc2cc3
--- /dev/null
+++ b/算法/前端/removeWithoutCopy.js
@@ -0,0 +1,44 @@
+/*
+ * @Description: 【FED19】	移除数组中的元素
+ * @Version: Beta1.0
+ * @Author: 【B站&公众号】Rong姐姐好可爱
+ * @Date: 2021-04-13 22:47:38
+ * @LastEditors: 【B站&公众号】Rong姐姐好可爱
+ * @LastEditTime: 2021-04-14 10:23:19
+ */
+
+
+/**
+ * 移除数组 arr 中的所有值与 item 相等的元素，直接在给定的 arr 数组上进行操作，并将结果返回
+ * @param {*} arr 
+ * @param {*} item 
+ * @returns 
+ */
+function removeWithoutCopy(arr, item) {
+
+  // const result= arr.filter(value=>value!==item)
+  // // 输出
+  // return result;
+
+  // 每次都和arr中的首个元素去比较
+
+  const len=arr.length;
+
+  for(let index=0;index<len;index++){
+    if(arr[0]!==item){
+      arr.push(arr[0])
+    }
+
+    // 删除第一个
+    arr.shift()
+  }
+
+  return arr;
+}
+
+const test = [1, 2, 2, 3, 4, 2, 2]
+console.log(removeWithoutCopy(test,2))
+
+
+
+