Runtime: 100 ms (Top 33.33%) | Memory: 44.3 MB (Top 33.33%)

Author: AnasImloul

scripts/algorithms/T/Transform to Chessboard/Transform to Chessboard.js

@@ -1,21 +1,22 @@
+// Runtime: 100 ms (Top 33.33%) | Memory: 44.3 MB (Top 33.33%)
 /**
  * @param {number[][]} board
  * @return {number}
  */
 var movesToChessboard = function(board) {
     const boardSize = board.length;
     const boardSizeIsEven = boardSize % 2 === 0;
-       
+
     if(!canBeTransformed(board)) return -1;
-    
+
     // to convert to 010101
     let rowSwap = 0;
     let colSwap = 0;
-    
+
     // to convert to 101010
     let rowSwap2 = 0;
     let colSwap2 = 0;
-    
+
     for(let i=0; i<boardSize; i++) {
         if(board[i][0] === i % 2) {
             rowSwap++;
@@ -28,26 +29,26 @@ var movesToChessboard = function(board) {
             colSwap2++;
         }
     }
-   
+
     // no need to swap anything
-    if((rowSwap + colSwap) === 0 || (rowSwap2 + colSwap2) === 0) return 0; 
-    
+    if((rowSwap + colSwap) === 0 || (rowSwap2 + colSwap2) === 0) return 0;
+
     if(boardSizeIsEven) {
         rowSwap = Math.min(rowSwap, rowSwap2);
         colSwap = Math.min(colSwap, colSwap2);
     } else {
-        rowSwap = rowSwap % 2 === 0  ? rowSwap : rowSwap2;
+        rowSwap = rowSwap % 2 === 0 ? rowSwap : rowSwap2;
         colSwap = colSwap % 2 === 0 ? colSwap : colSwap2;
     }
-   
+
     return (rowSwap + colSwap) / 2;
-    
+
     function canBeTransformed(board) {
         // number of 0 and 1 should be equal
         let sum = board[0].reduce((a,b) => a+b);
         if(boardSizeIsEven && sum != boardSize/2) return false;
         if(!boardSizeIsEven && sum > ((boardSize + 1)/2)) return false;
-        
+
         let first = board[0].join('');
         let opposite = board[0].map((item) => item === 1 ? 0 : 1).join('');
         // each row should be equal to first or opposite
@@ -68,4 +69,4 @@ var movesToChessboard = function(board) {
         }
         return Math.abs(counter[0] - counter[1]) === 1
     }
-};
+};