Merge branch 'master' of https://github.com/enkr1/leetcode_solutions

Author: enkr1

1572/my_solution.js

@@ -0,0 +1,34 @@
+/**
+ * @param {number[][]} mat
+ * @return {number}
+ */
+var diagonalSum = function (mat) {
+  let sum = 0, l = 0, r = mat[0].length - 1;
+
+  for (let row = 0; row < mat.length; row++) {
+    // for (let c = 0; c < mat[r].length; c++) {
+    console.log(`mat[row][l]:${mat[row][l]}, mat[row][r]:${mat[row][r]}`)
+    if (l === r) { // intersect
+      sum += mat[row][l];
+    } else {
+      sum += mat[row][l] + mat[row][r];
+    }
+
+    l++;
+    r--;
+    // }
+  }
+
+  return sum;
+};
+
+let x = null;
+x = diagonalSum([
+  [1, 2, 3],
+  [4, 5, 6],
+  [7, 8, 9]
+])
+
+
+console.log("Result");
+console.log(x);

1572/solution.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[][]} mat
+ * @return {number}
+ */
+var diagonalSum = function (mat) {
+  let sum = 0, l = 0, r = mat[0].length - 1;
+
+  for (let row = 0; row < mat.length; row++) {
+    if (l === r) {
+      sum += mat[row][l];
+    } else {
+      sum += mat[row][l] + mat[row][r];
+    }
+
+    l++;
+    r--;
+  }
+
+  return sum;
+};
+

2448/my_solution.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number[][]} image
+ * @return {number[][]}
+ */
+const flipAndInvertImage = (image) => {
+  // let result = Array.from({ length: image.length }, () => Array.from({ length: image[0].length }, () => []));
+  // console.log(result)
+  for (let row = 0; row < image.length; row++) {
+    let tmpArray = Array.from({ length: image[row].length }, () => []);
+    console.log(tmpArray)
+    for (let col = 0; col < image[row].length; col++) {
+      // result[row][image[row].length - 1 - col] = image[row][col] ^ 1;
+      tmpArray[image[row].length - 1 - col] = image[row][col] ^ 1;
+    }
+    console.log(tmpArray)
+    console.log(image)
+    image[row] = tmpArray
+    console.log(image)
+  }
+  return image;
+};
+
+let x = null;
+x = flipAndInvertImage([[1, 1, 0], [1, 0, 1], [0, 0, 0]])
+console.log("Result")
+console.log(x)

2448/solution.js

@@ -0,0 +1,30 @@
+/**
+ * @param {number[][]} image
+ * @return {number[][]}
+ */
+const flipAndInvertImage = (image) => { // inplace
+  for (let row = 0; row < image.length; row++) {
+    let tmpArray = Array.from({ length: image[row].length }, () => []);
+    for (let col = 0; col < image[row].length; col++) {
+      tmpArray[image[row].length - 1 - col] = image[row][col] ^ 1;
+    }
+    image[row] = tmpArray
+  }
+  return image;
+};
+
+let x = null;
+x = flipAndInvertImage([[1, 1, 0], [1, 0, 1], [0, 0, 0]])
+console.log("Result")
+console.log(x)
+
+
+// const flipAndInvertImage = (image) => {
+//   let result = Array.from({ length: image.length }, () => Array.from({ length: image[0].length }, () => []));
+//   for (let row = 0; row < image.length; row++) {
+//     for (let col = 0; col < image[row].length; col++) {
+//       result[row][image[row].length - 1 - col] = image[row][col] ^ 1;
+//     }
+//   }
+//   return result;
+// };

832/my_solution.js

@@ -68,19 +68,22 @@
 - [530. Minimum Absolute Difference in BST](./530/)
 - [647. Palindromic Substrings](./647/)
 - [771. Jewels and Stones](./771/)
+- [832. Flipping an Image](./832/)
 - [997. Find the Town Judge](./997/)
 - [1161. Maximum Level Sum of a Binary Tree](./1161/)
 - [1187. Make Array Strictly Increasing](./1187/)
 - [1365. How Many Numbers Are Smaller Than the Current Number](./1365/)
 - [1480. Running Sum of 1d Array](./1480/)
 - [1512. Number of Good Pairs](./1512/)
 - [1569. Number of Ways to Reorder Array to Get Same BST](./1569/)
+- [1572. Matrix Diagonal Sum](./1572/)
 - [1672. Richest Customer Wealth](./1672/)
 - [1791. Find Center of Star Graph](./1791/)
 - [1909. Remove One Element to Make the Array Strictly Increasing](./1909/)
 - [1971. Find if Path Exists in Graph](./1971/)
 - [2090. K Radius Subarray Averages](./2090/)
 - [2373. Largest Local Values in a Matrix](./2373/)
+- [2448. Minimum Cost to Make Array Equal](./2448/)
 
 ---
 
@@ -106,7 +109,7 @@ iex ./.../solution.ex
 
 Batch create:
 ```ssh
-chapter=997 && mkdir ./$chapter && touch ./$chapter/my_solution.ex && touch ./$chapter/solution.ex && alias x="iex ./$chapter/my_solution.ex"
+chapter=1572 && mkdir ./$chapter && touch ./$chapter/my_solution.ex && touch ./$chapter/solution.ex && alias x="iex ./$chapter/my_solution.ex"
 ```
 > then you can use `x` for quick debug.
 
@@ -128,7 +131,7 @@ Batch create:
 NOTE: JS IS HERE
 -->
 ```ssh
-chapter=1480 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
+chapter=832 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
 ```
 > then you can use `x` for quick debug.
 

832/solution.js

@@ -88,4 +88,15 @@
 // Decimal
 // console.log(Math.round(324631.99999999994));
 
-console.log(0 > 0);
+// console.log(0 > 0);
+
+console.log(0 ^ 0);
+console.log(1 ^ 0);
+// convert 0 -> 1; 1 -> 0
+console.log(0 ^ 1);
+console.log(1 ^ 1);
+console.log()
+console.log(0 & 0);
+console.log(1 & 0);
+console.log(0 & 1);
+console.log(1 & 1);