Update 200.岛屿数量.广搜版.md

problems/0200.岛屿数量.广搜版.md

@@ -276,6 +276,52 @@ var numIslands = function (grid) {
 };
 ```
 
+### TypeScript
+
+```TypeScript
+function numIslands2(grid: string[][]): number {
+	// 四个方向
+	const dir: number[][] = [[0, 1], [1, 0], [-1, 0], [0, -1]];
+	const [m, n]: [number, number] = [grid.length, grid[0].length];
+
+	function dfs(grid: string[][], visited: boolean[][], x: number, y: number) {
+		const queue: number[][] = [[x, y]];
+		while (queue.length !== 0) {
+			//取出队列头部元素
+			const top: number[] = queue.shift()!;
+			for (let i = 0; i < 4; i++) {
+				const nextX: number = top[0] + dir[i][0];
+				const nextY: number = top[1] + dir[i][1];
+				// 越界了，直接跳过
+				if (nextX < 0 || nextX >= m || nextY < 0 || nextY >= n) {
+					continue;
+				}
+				if (!visited[nextX][nextY] && grid[nextX][nextY] === '1') {
+					queue.push([nextX, nextY]);
+					// 只要加入队列立刻标记
+					visited[nextX][nextY] = true;
+				}
+			}
+		}
+	}
+
+	const visited: boolean[][] = Array.from({ length: m }, _ => new Array(n).fill(false));
+
+	let result = 0;
+	for (let i = 0; i < m; i++) {
+		for (let k = 0; k < n; k++) {
+			if (!visited[i][k] && grid[i][k] === '1') {
+				++result; // 遇到没访问过的陆地，+1
+				visited[i][k] = true;
+				dfs(grid, visited, i, k); // 将与其链接的陆地都标记上 true
+			}
+		}
+	}
+	return result;
+}
+```
+
+
 ### Rust
 
 ```rust