回溯·pruning模式

电话号码的字母组合

Generate all letter combinations a digit string can represent using backtracking with pruning, leveraging hash table map…

组合总和

Find all unique combinations of numbers from a distinct array that sum to a target using controlled backtracking search.

组合总和 II

Find all unique combinations of numbers that sum to a target using backtracking with careful pruning to avoid duplicates…

全排列

Generate all possible orderings of a distinct integer array using backtracking search with careful pruning to avoid dupl…

全排列 II

Generate all unique permutations of an array containing duplicates using backtracking and pruning to avoid repeated sequ…

N 皇后

Solve the N-Queens problem using backtracking with pruning, exploring all valid board placements while avoiding conflict…

N 皇后 II

Solve the N-Queens II problem using backtracking with pruning to efficiently count all valid placements for n queens on …

组合

Generate all combinations of k numbers from the range [1, n] using backtracking and pruning.

子集

Generate all subsets of a set of unique integers using backtracking with pruning to avoid duplicates.

单词搜索

Solve Word Search with backtracking by exploring adjacent cells to match a target word in a grid.

格雷编码

Generate an n-bit Gray Code sequence using backtracking with pruning and bit manipulation techniques.

子集 II

Subsets II problem asks to generate unique subsets from an array with possible duplicates using backtracking search with…

复原 IP 地址

Restore all valid IP addresses from a string using backtracking with pruning, avoiding invalid segments or leading zeros…

单词接龙 II

Find all shortest transformation sequences from beginWord to endWord using a dictionary, leveraging backtracking search …

单词搜索 II

Solve the Word Search II problem using backtracking with pruning to find all words on a board of characters.

组合总和 III

Find all unique combinations of k numbers adding to n using efficient backtracking with pruning in arrays.

给表达式添加运算符

Expression Add Operators is solved with backtracking that builds multi-digit operands and tracks multiplication preceden…

删除无效的括号

Remove the minimum number of invalid parentheses to generate all possible valid strings efficiently using backtracking a…

累加数

Additive Number is solved by trying the first two splits, then pruning aggressively while verifying each required sum in…

二进制手表

Binary Watch involves generating possible times on a binary watch given a number of turned-on LEDs.

24 点游戏

Solve the 24 Game by arranging four card numbers using arithmetic operators and parentheses to reach exactly 24 efficien…

字母大小写全排列

Letter Case Permutation involves generating all possible strings by changing the case of each letter in a given string.

模糊坐标

Find all valid 2D coordinate possibilities for an ambiguous input string using backtracking and pruning techniques.

将数组拆分成斐波那契序列

This problem challenges you to split a string into a Fibonacci-like sequence using backtracking and pruning.