feat: update solutions to lc problems: No.1032,1034

* No.1032.Stream of Characters
* No.1034.Coloring A Border

Author: yanglbme

solution/1000-1099/1032.Stream of Characters/README.md

@@ -147,7 +147,7 @@ class Trie {
 
     public boolean query(StringBuilder s) {
         Trie node = this;
-        for (int i = s.length() - 1, j = 0; i >= 0 && j < 201; --i, ++j) {
+        for (int i = s.length() - 1; i >= 0; --i) {
             int idx = s.charAt(i) - 'a';
             if (node.children[idx] == null) {
                 return false;
@@ -211,7 +211,7 @@ public:
 
     bool search(string& w) {
         Trie* node = this;
-        for (int i = w.size() - 1, j = 0; ~i && j < 201; --i, ++j) {
+        for (int i = w.size() - 1; ~i; --i) {
             int idx = w[i] - 'a';
             if (!node->children[idx]) {
                 return false;
@@ -231,7 +231,7 @@ public:
     string s;
 
     StreamChecker(vector<string>& words) {
-        for (auto& w : words) {
+        for (auto&& w : words) {
             trie->insert(w);
         }
     }
@@ -275,7 +275,7 @@ func (this *Trie) Insert(word string) {
 
 func (this *Trie) Search(word []byte) bool {
 	node := this
-	for i, j := len(word)-1, 0; i >= 0 && j < 201; i, j = i-1, j+1 {
+	for i := len(word) - 1; i >= 0; i-- {
 		idx := word[i] - 'a'
 		if node.children[idx] == nil {
 			return false

solution/1000-1099/1032.Stream of Characters/README_EN.md

@@ -124,7 +124,7 @@ class Trie {
 
     public boolean query(StringBuilder s) {
         Trie node = this;
-        for (int i = s.length() - 1, j = 0; i >= 0 && j < 201; --i, ++j) {
+        for (int i = s.length() - 1; i >= 0; --i) {
             int idx = s.charAt(i) - 'a';
             if (node.children[idx] == null) {
                 return false;
@@ -188,7 +188,7 @@ public:
 
     bool search(string& w) {
         Trie* node = this;
-        for (int i = w.size() - 1, j = 0; ~i && j < 201; --i, ++j) {
+        for (int i = w.size() - 1; ~i; --i) {
             int idx = w[i] - 'a';
             if (!node->children[idx]) {
                 return false;
@@ -208,7 +208,7 @@ public:
     string s;
 
     StreamChecker(vector<string>& words) {
-        for (auto& w : words) {
+        for (auto&& w : words) {
             trie->insert(w);
         }
     }
@@ -252,7 +252,7 @@ func (this *Trie) Insert(word string) {
 
 func (this *Trie) Search(word []byte) bool {
 	node := this
-	for i, j := len(word)-1, 0; i >= 0 && j < 201; i, j = i-1, j+1 {
+	for i := len(word) - 1; i >= 0; i-- {
 		idx := word[i] - 'a'
 		if node.children[idx] == nil {
 			return false

solution/1000-1099/1032.Stream of Characters/Solution.cpp

@@ -22,7 +22,7 @@ class Trie {
 
     bool search(string& w) {
         Trie* node = this;
-        for (int i = w.size() - 1, j = 0; ~i && j < 201; --i, ++j) {
+        for (int i = w.size() - 1; ~i; --i) {
             int idx = w[i] - 'a';
             if (!node->children[idx]) {
                 return false;
@@ -42,7 +42,7 @@ class StreamChecker {
     string s;
 
     StreamChecker(vector<string>& words) {
-        for (auto& w : words) {
+        for (auto&& w : words) {
             trie->insert(w);
         }
     }

solution/1000-1099/1032.Stream of Characters/Solution.go

@@ -21,7 +21,7 @@ func (this *Trie) Insert(word string) {
 
 func (this *Trie) Search(word []byte) bool {
 	node := this
-	for i, j := len(word)-1, 0; i >= 0 && j < 201; i, j = i-1, j+1 {
+	for i := len(word) - 1; i >= 0; i-- {
 		idx := word[i] - 'a'
 		if node.children[idx] == nil {
 			return false

solution/1000-1099/1032.Stream of Characters/Solution.java

@@ -16,7 +16,7 @@ public void insert(String w) {
 
     public boolean query(StringBuilder s) {
         Trie node = this;
-        for (int i = s.length() - 1, j = 0; i >= 0 && j < 201; --i, ++j) {
+        for (int i = s.length() - 1; i >= 0; --i) {
             int idx = s.charAt(i) - 'a';
             if (node.children[idx] == null) {
                 return false;

solution/1000-1099/1034.Coloring A Border/README.md

@@ -210,6 +210,42 @@ func colorBorder(grid [][]int, row int, col int, color int) [][]int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function colorBorder(
+    grid: number[][],
+    row: number,
+    col: number,
+    color: number,
+): number[][] {
+    const m = grid.length;
+    const n = grid[0].length;
+    const vis = new Array(m).fill(0).map(() => new Array(n).fill(false));
+    const dirs = [-1, 0, 1, 0, -1];
+    const dfs = (i: number, j: number, c: number) => {
+        vis[i][j] = true;
+        for (let k = 0; k < 4; ++k) {
+            const x = i + dirs[k];
+            const y = j + dirs[k + 1];
+            if (x >= 0 && x < m && y >= 0 && y < n) {
+                if (!vis[x][y]) {
+                    if (grid[x][y] == c) {
+                        dfs(x, y, c);
+                    } else {
+                        grid[i][j] = color;
+                    }
+                }
+            } else {
+                grid[i][j] = color;
+            }
+        }
+    };
+    dfs(row, col, grid[row][col]);
+    return grid;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1034.Coloring A Border/README_EN.md

@@ -176,6 +176,42 @@ func colorBorder(grid [][]int, row int, col int, color int) [][]int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function colorBorder(
+    grid: number[][],
+    row: number,
+    col: number,
+    color: number,
+): number[][] {
+    const m = grid.length;
+    const n = grid[0].length;
+    const vis = new Array(m).fill(0).map(() => new Array(n).fill(false));
+    const dirs = [-1, 0, 1, 0, -1];
+    const dfs = (i: number, j: number, c: number) => {
+        vis[i][j] = true;
+        for (let k = 0; k < 4; ++k) {
+            const x = i + dirs[k];
+            const y = j + dirs[k + 1];
+            if (x >= 0 && x < m && y >= 0 && y < n) {
+                if (!vis[x][y]) {
+                    if (grid[x][y] == c) {
+                        dfs(x, y, c);
+                    } else {
+                        grid[i][j] = color;
+                    }
+                }
+            } else {
+                grid[i][j] = color;
+            }
+        }
+    };
+    dfs(row, col, grid[row][col]);
+    return grid;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1034.Coloring A Border/Solution.ts

@@ -0,0 +1,31 @@
+function colorBorder(
+    grid: number[][],
+    row: number,
+    col: number,
+    color: number,
+): number[][] {
+    const m = grid.length;
+    const n = grid[0].length;
+    const vis = new Array(m).fill(0).map(() => new Array(n).fill(false));
+    const dirs = [-1, 0, 1, 0, -1];
+    const dfs = (i: number, j: number, c: number) => {
+        vis[i][j] = true;
+        for (let k = 0; k < 4; ++k) {
+            const x = i + dirs[k];
+            const y = j + dirs[k + 1];
+            if (x >= 0 && x < m && y >= 0 && y < n) {
+                if (!vis[x][y]) {
+                    if (grid[x][y] == c) {
+                        dfs(x, y, c);
+                    } else {
+                        grid[i][j] = color;
+                    }
+                }
+            } else {
+                grid[i][j] = color;
+            }
+        }
+    };
+    dfs(row, col, grid[row][col]);
+    return grid;
+}

solution/1700-1799/1760.Minimum Limit of Balls in a Bag/README_EN.md

@@ -10,12 +10,10 @@
 
 <ul>
 	<li>Take any bag of balls and divide it into two new bags with a <strong>positive </strong>number of balls.
-
     <ul>
     	<li>For example, a bag of <code>5</code> balls can become two new bags of <code>1</code> and <code>4</code> balls, or two new bags of <code>2</code> and <code>3</code> balls.</li>
     </ul>
     </li>
-
 </ul>
 
 <p>Your penalty is the <strong>maximum</strong> number of balls in a bag. You want to <strong>minimize</strong> your penalty after the operations.</p>