add js solutions to leetcode problems: no.54 and no.189 (#370)

* add js solution to leetcode problem: no.189

* add js solution to leetcode problem: no.54

* add some discriptions

Author: lo0b0o

solution/0000-0099/0054.Spiral Matrix/README.md

@@ -114,6 +114,37 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[][]} matrix
+ * @return {number[]}
+ */
+var spiralOrder = function (matrix) {
+    let m = matrix.length;
+    if (m === 0) return [];
+    let res = [];
+    let top = 0, bottom = m - 1, left = 0, right = matrix[0].length - 1;
+    while (left < right && bottom > top) {
+        for (let i = left; i < right; i++) res.push(matrix[top][i]);
+        for (let i = top; i < bottom; i++) res.push(matrix[i][right]);
+        for (let i = right; i > left; i--) res.push(matrix[bottom][i]);
+        for (let i = bottom; i > top; i--) res.push(matrix[i][left]);
+        top++;
+        bottom--;
+        left++;
+        right--;
+    }
+    if (left === right) {
+        for (i = top; i <= bottom; i++) res.push(matrix[i][left]);
+    } else if (top === bottom) {
+        for (i = left; i <= right; i++) res.push(matrix[top][i]);
+    }
+    return res;
+};
+```
+
 ### **...**
 
 ```

solution/0000-0099/0054.Spiral Matrix/README_EN.md

@@ -103,6 +103,37 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[][]} matrix
+ * @return {number[]}
+ */
+var spiralOrder = function (matrix) {
+    let m = matrix.length;
+    if (m === 0) return [];
+    let res = [];
+    let top = 0, bottom = m - 1, left = 0, right = matrix[0].length - 1;
+    while (left < right && bottom > top) {
+        for (let i = left; i < right; i++) res.push(matrix[top][i]);
+        for (let i = top; i < bottom; i++) res.push(matrix[i][right]);
+        for (let i = right; i > left; i--) res.push(matrix[bottom][i]);
+        for (let i = bottom; i > top; i--) res.push(matrix[i][left]);
+        top++;
+        bottom--;
+        left++;
+        right--;
+    }
+    if (left === right) {
+        for (i = top; i <= bottom; i++) res.push(matrix[i][left]);
+    } else if (top === bottom) {
+        for (i = left; i <= right; i++) res.push(matrix[top][i]);
+    }
+    return res;
+};
+```
+
 ### **...**
 
 ```

solution/0000-0099/0054.Spiral Matrix/Solution.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number[][]} matrix
+ * @return {number[]}
+ */
+var spiralOrder = function (matrix) {
+    let m = matrix.length;
+    if (m === 0) return [];
+    let res = [];
+    let top = 0, bottom = m - 1, left = 0, right = matrix[0].length - 1;
+    while (left < right && bottom > top) {
+        for (let i = left; i < right; i++) res.push(matrix[top][i]);
+        for (let i = top; i < bottom; i++) res.push(matrix[i][right]);
+        for (let i = right; i > left; i--) res.push(matrix[bottom][i]);
+        for (let i = bottom; i > top; i--) res.push(matrix[i][left]);
+        top++;
+        bottom--;
+        left++;
+        right--;
+    }
+    if (left === right) {
+        for (i = top; i <= bottom; i++) res.push(matrix[i][left]);
+    } else if (top === bottom) {
+        for (i = left; i <= right; i++) res.push(matrix[top][i]);
+    }
+    return res;
+};

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

@@ -119,6 +119,23 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+使用原生 API 将数组的 `k~n-1` 范围内的元素插入到前面
+
+```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;
+    nums.splice(0, 0, ...nums.splice(-k, k))
+};
+```
+
 ### **...**
 
 ```

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

@@ -98,6 +98,20 @@ class 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;
+    nums.splice(0, 0, ...nums.splice(-k, k))
+};
+```
+
 ### **...**
 
 ```

solution/0100-0199/0189.Rotate Array/Solution.js

@@ -0,0 +1,9 @@
+/**
+ * @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;
+    nums.splice(0, 0, ...nums.splice(-k, k))
+};