题库chevron_right分类chevron_right枚举
label

枚举

118 道题目
简单: 26中等: 58困难: 34

枚举 是技术面试里最常出现的能力维度之一。建议先掌握基础题型的边界处理,再逐步过渡到模式识别和复杂度 trade-off。

面试场景

高频考察问题建模、边界条件与口头表达的清晰度。

常见误区

只背模板不解释为什么,容易在追问里失分。

练习策略

每轮练 3-5 题,固定复盘复杂度和可替代解法。

推荐练习顺序

题库

枚举 题库

先展示一段最适合快速浏览的题目列表,继续滚动时再慢慢续载,避免专题页被长列表一下子拉穿。

慢加载专题题库

适合这类题很多的专题,先扫结构,再逐步深入。

hourglass_bottom滚动续载
search
tune难度

当前展示 24 / 118 道题目

每次续载 24 题
#题目难度
204

计数质数

Count all prime numbers less than a given integer n using efficient array and math-based enumeration techniques.

中等
479

最大回文数乘积

Find the largest palindromic number from the product of two n-digit integers using math and enumeration efficiently.

困难
816

模糊坐标

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

中等
829

连续整数求和

Find the number of ways to express a number as the sum of consecutive positive integers.

困难
845

数组中的最长山脉

Find the length of the longest subarray forming a mountain pattern using state transitions and two-pointer logic efficie…

中等
869

重新排序得到 2 的幂

Determine if a number's digits can be rearranged to form a power of two using counting and hash-based checks.

中等
906

超级回文数

Count all super-palindromes in a given numeric range, where each is a palindrome and square of a palindrome.

困难
949

给定数字能组成的最大时间

Given four digits, determine the latest valid 24-hour time possible using each digit exactly once with backtracking.

中等
970

强整数

Find all integers that can be expressed as x^i + y^j up to a given bound using a Hash Table plus Math approach.

中等
1291

顺次数

Find all integers within a range whose digits form a strictly increasing consecutive sequence using enumeration techniqu…

中等
1534

统计好三元组

Count Good Triplets requires identifying all triplets in an array that satisfy multiple absolute difference constraints …

简单
1566

重复至少 K 次且长度为 M 的模式

Determine if a subarray of length m repeats k or more consecutive times in a given integer array efficiently.

简单
1601

最多可达成的换楼请求数目

Find the maximum number of achievable transfer requests between buildings with constraints on net employee transfers.

困难
1617

统计子树中城市之间最大距离

This problem asks you to count subtrees in a tree structure where the maximum distance between any two cities matches sp…

困难
1620

网络信号最好的坐标

Determine the coordinate with the maximum network quality by summing signal strengths from all reachable towers efficien…

中等
1625

执行操作后字典序最小的字符串

Optimize a string through rotations and additions to get the lexicographically smallest possible result using string man…

中等
1638

统计只差一个字符的子串数目

Count all substrings from s that differ by exactly one character from some substring in t using precise substring compar…

中等
1761

一个图中连通三元组的最小度数

Find the minimum degree of a connected trio in a graph using enumeration over nodes and edges.

困难
1849

将字符串拆分为递减的连续值

Check if a string of digits can be split into descending consecutive values where the difference between them is 1.

中等
1863

找出所有子集的异或总和再求和

Compute the sum of all subset XOR totals using a backtracking search with pruning for arrays of small size.

简单
1925

统计平方和三元组的数目

Count Square Sum Triples asks to find the number of integer triples where a² + b² = c² for values between 1 and n.

简单
1952

三除数

Determine if a given integer has exactly three positive divisors.

简单
1958

检查操作是否合法

Determine if a move on an 8x8 board is legal by validating lines in all directions using array and matrix patterns.

中等
1995

统计特殊四元组

Count Special Quadruplets requires scanning arrays and using hash lookups to efficiently find quadruplets matching sum c…

简单

swap_vert在题库框内继续向下滚动,也会自动续载

关联高频模式

LeetCode 枚举题型题解:118题训练路线