添加顺时针打印矩阵的经典思路解法以及添加顺时针旋转矩阵的解法

skylinebin · skylinebin · commit fac36a33cc7a · 2019-04-28T20:16:38.000+08:00
diff --git a/Algorithms/basic_algorithm/applicationAlgorithms/rotateSquareMatrix.js b/Algorithms/basic_algorithm/applicationAlgorithms/rotateSquareMatrix.js
@@ -0,0 +1,42 @@
+/******
+ * 
+ * 
+ * &#23558;&#27491;&#26041;&#24418;&#30697;&#38453;&#39034;&#26102;&#38024;&#26059;&#36716; 90 &#24230;
+ * 
+ * &#20027;&#35201;&#26159;&#26126;&#30333; &#22806;&#38754;&#30340;&#19968;&#20010;&#26694;&#24590;&#20040;&#26059;&#36716;
+ * 
+ */
+
+function rotateSquareMatrix(matrix) {
+    var lr = 0;
+    var lc = 0;
+    var rr = matrix.length - 1;
+    var rc = matrix[0].length - 1;
+
+    this.rotateEdge = function (matrix, tlr, tlc, trr, trc){
+        var allnum = trr - tlr;
+        var tempdata = 0;
+        for (let i = 0; i < allnum; i++) {
+            tempdata = matrix[tlr][tlc + i];
+            matrix[tlr][tlc + i] = matrix[trr - i][tlc];
+            matrix[trr - i][tlc] = matrix[trr][trc - i];
+            matrix[trr][trc - i] = matrix[tlr + i][trc];
+            matrix[tlr + i][trc] = tempdata;
+        }
+    }
+
+    while (lr < rr){
+        this.rotateEdge(matrix, lr++, lc++, rr--, rc--);
+    }
+
+    return matrix;
+}
+
+
+var matrix = [];
+matrix[0] = [1, 2, 3, 4];
+matrix[1] = [5, 6, 7, 8];
+matrix[2] = [9, 10, 11, 12];
+matrix[3] = [13, 14, 15, 16];
+
+console.log(rotateSquareMatrix(matrix));
diff --git a/NowCoder/Leetcode/printMatrixbyClockwise.js b/NowCoder/Leetcode/printMatrixbyClockwise.js
@@ -46,6 +46,55 @@ function printMatrix(matrix) {
     return output;
 }
 
+
+// &#20351;&#29992;&#32463;&#20856;&#24605;&#36335;&#35299;&#31572;&#30697;&#38453;&#25171;&#21360;&#38382;&#39064;
+function printMatrix2(matrix) {
+    var lr = 0,lc=0; // lr = left row, lc = left column &#24038;&#19978;&#35282;&#24320;&#22987;&#30340;&#22352;&#26631;
+    var rr = matrix.length-1; // rr = right row
+    var rc = matrix[0].length-1; // rc = right column &#21491;&#19979;&#35282;&#22352;&#26631;
+    var output = [];
+
+    this.printEdge = function(matrix, tlr,tlc,trr,trc){
+        if (tlr === trr) {
+            for (let i = tlc; i <=trc; i++) {
+                output.push(matrix[tlr][i]);
+            }
+        } else if (tlc === trc) {
+            for (let i = tlr; i <=trr; i++) {
+                output.push(matrix[i][tlc]);
+            }
+        } else {
+            var curlr = tlr; // &#33719;&#21462;&#24403;&#21069;&#34892;
+            var curlc = tlc; // &#33719;&#21462;&#24403;&#21069;&#21015;
+            while (curlc !== trc) {
+                output.push(matrix[tlr][curlc]);
+                curlc++;
+            }
+            while(curlr !== trr) {
+                output.push(matrix[curlr][trc]);
+                curlr++;
+            }
+            while(curlc !== tlc){
+                output.push(matrix[trr][curlc]);
+                curlc--;
+            }
+            while(curlr !== tlr){
+                output.push(matrix[curlr][tlc]);
+                curlr--;
+            }
+        }
+    }
+
+    // &#27599;&#27425;&#25171;&#21360;&#30001;&#24038;&#19978;&#35282;&#21644;&#21491;&#19979;&#35282;&#32452;&#25104;&#30340;&#19968;&#20010;&#26694;
+    // &#24038;&#19978;&#35282;&#30340;&#34892; &#23567;&#20110;&#31561;&#20110; &#21491;&#19979;&#35282;&#30340;&#34892; &#24038;&#19978;&#35282;&#30340;&#21015; &#23567;&#20110;&#31561;&#20110; &#21491;&#19979;&#35282;&#30340;&#21015;
+    while(lr <= rr && lc <= rc){
+        this.printEdge(matrix, lr++, lc++, rr--, rc--);
+    }
+    return output;
+}
+
+
+
 var matrix = [];
 // matrix[0] = [1,2,3,4];
 // matrix[1] = [5,6,7,8];
@@ -56,4 +105,5 @@ matrix[1] = [3,4];
 matrix[2] = [5,6];
 matrix[3] = [7,8];
 
-console.log(printMatrix(matrix));
+console.log(printMatrix(matrix));
+console.log(printMatrix2(matrix));
