feat: add js solution to lc problem: No.1636 (doocs#1001)

Author: Qiu-IT

solution/1600-1699/1636.Sort Array by Increasing Frequency/README.md

@@ -159,6 +159,23 @@ impl Solution {
 }
 ```
 
+### **Javascript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var frequencySort = function (nums) {
+    const m = new Map();
+    for (let i = 0; i < nums.length; i++) {
+        m.set(nums[i], (m.get(nums[i]) || 0) + 1);
+    }
+    nums.sort((a, b) => (m.get(a) != m.get(b) ? m.get(a) - m.get(b) : b - a));
+    return nums;
+};
+```
+
 ### **...**
 
 ```

solution/1600-1699/1636.Sort Array by Increasing Frequency/README_EN.md

@@ -144,6 +144,23 @@ impl Solution {
 }
 ```
 
+### **Javascript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var frequencySort = function (nums) {
+    const m = new Map();
+    for (let i = 0; i < nums.length; i++) {
+        m.set(nums[i], (m.get(nums[i]) || 0) + 1);
+    }
+    nums.sort((a, b) => (m.get(a) != m.get(b) ? m.get(a) - m.get(b) : b - a));
+    return nums;
+};
+```
+
 ### **...**
 
 ```

solution/1600-1699/1636.Sort Array by Increasing Frequency/Solution.js

@@ -0,0 +1,12 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var frequencySort = function (nums) {
+    const m = new Map();
+    for (let i = 0; i < nums.length; i++) {
+        m.set(nums[i], (m.get(nums[i]) || 0) + 1);
+    }
+    nums.sort((a, b) => (m.get(a) != m.get(b) ? m.get(a) - m.get(b) : b - a));
+    return nums;
+};