图·搜索模式

单词接龙

Find the shortest transformation sequence from a start word to an end word, with each word in the sequence differing by …

被围绕的区域

Transform the matrix in-place by marking regions surrounded by 'X' as 'X', while keeping border-adjacent 'O's intact.

岛屿数量

Count the number of distinct islands in a binary grid using array traversal combined with depth-first search exploration…

课程表

Determine if all courses can be completed by analyzing prerequisite dependencies using indegree tracking and topological…

课程表 II

Solve the 'Course Schedule II' problem using graph indegree and topological ordering, utilizing DFS or BFS to find the c…

添加与搜索单词 - 数据结构设计

Build a WordDictionary supporting dynamic word addition and search with wildcard matching efficiently using Trie and DFS…

最小高度树

Identify all roots of a tree that produce minimum height using graph indegree analysis and topological trimming.

水壶问题

Determine if two jugs with given capacities can measure an exact target amount using math and DFS strategies efficiently…

字典序排数

Generate all numbers from 1 to n in lexicographical order using a depth-first search pattern optimized with trie logic f…

接雨水 II

Solve Trapping Rain Water II using breadth-first search and priority queues for efficient water trapping in a matrix.

太平洋大西洋水流问题

Find all cells on an island where water can flow to both the Pacific and Atlantic oceans using DFS or BFS.

棋盘上的战舰

Count the number of non-overlapping battleships on a 2D board using array traversal and depth-first search patterns effi…

最小基因变化

Determine the minimum number of single-character gene mutations to reach the target gene using BFS and a hash table look…

岛屿的周长

Determine the perimeter of an island in a grid of land and water cells using DFS or BFS.

扫雷游戏

Solve the Minesweeper game by updating revealed squares and handling clicks with Depth-First Search and Array manipulati…

数组嵌套

Find the longest nested set in a permutation array using a depth-first traversal, handling cycles efficiently for medium…

为高尔夫比赛砍树

Determine the minimum steps to cut all trees in a forest matrix in ascending height order using BFS traversal and priori…

实现一个魔法字典

Design a Magic Dictionary to allow searching with one-character modifications, using Hash Table and String techniques.

岛屿的最大面积

Find the largest connected land area in a binary grid using array traversal and depth-first search efficiently.

图像渲染

Flood Fill is an array and DFS problem where you change connected pixels to a target color efficiently using recursion o…

隔离病毒

Contain Virus involves using array-based Depth-First Search to contain viral spread by building walls around infected re…

金字塔转换矩阵

The Pyramid Transition Matrix problem requires determining whether a pyramid can be formed with given blocks and valid p…

找到最终的安全状态

Solve the problem of finding eventual safe states in a directed graph using depth-first search and topological sorting.

最大人工岛

Calculate the largest island size by converting at most one zero in a binary grid using array and DFS techniques efficie…