feat: add a JS solution of 189

solution/0100-0199/0189.Rotate Array/README.md

@@ -174,7 +174,35 @@ impl Solution {
     }
 }
 ```
+### **JavaScript**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+使用三次数组翻转
 
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+ var rotate = function(nums, k) {
+    k%=nums.length;
+    reverse(nums,0,nums.length-1);
+    reverse(nums,0,k-1);
+    reverse(nums,k,nums.length-1);
+
+};
+function reverse(nums,start,end){
+    while(start<end){
+        const temp = nums[start];
+        nums[start]=nums[end];
+        nums[end]=temp;
+        start+=1;
+        end-=1;
+    }
+}
+```
 ### **...**
 
 ```

solution/0100-0199/0189.Rotate Array/README_EN.md

@@ -150,6 +150,34 @@ impl Solution {
 }
 ```
 
+### **JavaScript**
+
+Use three array flips
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+ var rotate = function(nums, k) {
+    k%=nums.length;
+    reverse(nums,0,nums.length-1);
+    reverse(nums,0,k-1);
+    reverse(nums,k,nums.length-1);
+
+};
+function reverse(nums,start,end){
+    while(start<end){
+        const temp = nums[start];
+        nums[start]=nums[end];
+        nums[end]=temp;
+        start+=1;
+        end-=1;
+    }
+}
+```
+
 ### **...**
 
 ```