7.13

Author: zhangzhengxian

README.md

@@ -39,6 +39,7 @@
 |43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [JavaScript](./algorithms/Multiply_Strings.js)|Medium|
 |46|[Permutations](https://leetcode.com/problems/permutations/)| [JavaScript](./algorithms/Permutations.js)|Medium|
 |47|[Permutations II](https://leetcode.com/problems/permutations-ii/)| [JavaScript](./algorithms/PermutationsII.js)|Medium|
+|48|[Rotate Image](https://leetcode.com/problems/permutations-ii/)| [JavaScript](./algorithms/ RotateImage.js)|Medium|
 |69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/)| [JavaScript](./algorithms/Sqrt(x).js)|Easy|
 |371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)| [JavaScript](./algorithms/Sum_of_Two_Integers.js)|Easy|
 |372|[Super Pow](https://leetcode.com/problems/super-pow/)| [JavaScript](./algorithms/SuperPow.js)|Medium|

algorithms/RotateImage.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[][]} matrix
+ * @return {void} Do not return anything, modify matrix in-place instead.
+ */
+var rotate = function(matrix) {
+    var l = matrix.length,
+        temp = [];
+    for (var i = 0; i < Math.floor(l / 2); i++){
+        for(var j = i; j < l - i - 1; j++) {
+            temp = [matrix[i][j], matrix[j][l - i - 1], matrix[l - i - 1][l - j - 1], matrix[l - j - 1][i]];
+            matrix[i][j] = temp[3];
+            matrix[j][l - i - 1] = temp[0];
+            matrix[l - i - 1][l - j - 1] = temp[1];
+            matrix[l - j -1][i] = temp[2];
+        }
+    }
+};