flipAndInvertImage

Author: aouos

Diff for: README.md

@@ -78,6 +78,7 @@
 | 0814 | [pruneTree](./code/0814_pruneTree) | ⭐ | Tree |  |
 | 0821 | [shortestToChar](./code/0821_shortestToChar) | ⭐ | Greedy |  |
 | 0830 | [largeGroupPositions](./code/0830_largeGroupPositions) | ⭐ | Array |  |
+| 0832 | [flipAndInvertImage](./code/0832_flipAndInvertImage) | ⭐ | Array |  |
 | 0860 | [lemonadeChange](./code/0860_lemonadeChange) | ⭐ | Greedy |  |
 | 0888 | [fairCandySwap](./code/0888_fairCandySwap) | ⭐ | Array | 1️⃣✅ |
 | 0922 | [sortArrayByParityII](./code/0922_sortArrayByParityII) | ⭐ | Array, Sort |  |

Diff for: code/0030_findSubstring/findSubstringV2.js

@@ -0,0 +1,30 @@
+/**
+ * @param {string} s
+ * @param {string[]} words
+ * @return {number[]}
+ */
+var findSubstring = function (s, words) {
+  const wordSize = words[0].length;
+  const wordsLen = wordSize * words.length;
+  let map = new Map();
+  let ans = [];
+  for (let i = 0; i < words.length; i++) {
+    map.has(words[i]) ? map.set(words[i], map.get(words[i]) + 1) : map.set(words[i], 1);
+  }
+  for (let i = 0; i < s.length - wordsLen + 1; i++) {
+    const tmap = new Map(map);
+    let count = words.length;
+    for (let p = i; p < i + wordsLen; p += wordSize) {
+      const word = s.slice(p, p + wordSize);
+      if (!tmap.has(word) || tmap.get(word) <= 0) {
+        break;
+      }
+      tmap.set(word, tmap.get(word) - 1);
+      count--;
+    }
+    if (count === 0) {
+      ans.push(i);
+    }
+  }
+  return ans;
+};

Diff for: code/0832_flipAndInvertImage/flipAndInvertImage.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[][]} A
+ * @return {number[][]}
+ */
+var flipAndInvertImage = function(A) {
+  for (let i = 0; i < A.length; i++) {
+    let m = 0, n = A.length - 1;
+    while (m < n) {
+      [A[i][m], A[i][n]] = [A[i][n], A[i][m]];
+      m++;
+      n--;
+    }
+    for (let j = 0; j < A[i].length; j++) {
+      A[i][j] === 1 ? A[i][j] = 0 : A[i][j] = 1;
+    }
+  }
+  return A;
+};
+
+// 时间复杂度 O(N²)
+// 空间复杂度 O(1)