Number Theory on LeetCode 题解笔记

Number Theory on LeetCode 题解笔记https://leetcode-solutions-5zk.pages.dev/tags/number-theory/Recent content in Number Theory on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +08003348. 最小可整除数字乘积 IIhttps://leetcode-solutions-5zk.pages.dev/posts/3348-smallest-divisible-digit-product-ii/Wed, 06 May 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3348-smallest-divisible-digit-product-ii/Hard | Math, String, Backtracking, Greedy, Number Theory1819. 不同子序列 GCD 的数量https://leetcode-solutions-5zk.pages.dev/posts/1819-number-of-different-subsequences-gcds/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1819-number-of-different-subsequences-gcds/Hard | Array, Math, Counting, Number Theory1994. 好子集的数目https://leetcode-solutions-5zk.pages.dev/posts/1994-the-number-of-good-subsets/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1994-the-number-of-good-subsets/Hard | Array, Hash Table, Math, Dynamic Programming, Bit Manipulation, Counting, Number Theory, Bitmask2338. 统计理想数组的数目https://leetcode-solutions-5zk.pages.dev/posts/2338-count-the-number-of-ideal-arrays/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2338-count-the-number-of-ideal-arrays/Hard | Math, Dynamic Programming, Combinatorics, Number Theory1447. 简化分数https://leetcode-solutions-5zk.pages.dev/posts/1447-simplified-fractions/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1447-simplified-fractions/Medium | Math, String, Number Theory3574. 最大化子数组GCD分数https://leetcode-solutions-5zk.pages.dev/posts/3574-maximize-subarray-gcd-score/Wed, 29 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3574-maximize-subarray-gcd-score/Hard | Array, Math, Enumeration, Number Theory3233. 找出不是特殊数字的数字数量https://leetcode-solutions-5zk.pages.dev/posts/3233-find-the-count-of-numbers-which-are-not-special/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3233-find-the-count-of-numbers-which-are-not-special/Medium | Array, Math, Number Theory3260. 找到能被 K 整除的最大回文数https://leetcode-solutions-5zk.pages.dev/posts/3260-find-the-largest-palindrome-divisible-by-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3260-find-the-largest-palindrome-divisible-by-k/Hard | Math, String, Dynamic Programming, Greedy, Number Theory3312. 排序的最大公约数对查询https://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3312-sorted-gcd-pair-queries/Hard | Array, Hash Table, Math, Binary Search, Combinatorics, Counting, Number Theory, Prefix Sum3326. 使数组非递减的最小除法运算次数https://leetcode-solutions-5zk.pages.dev/posts/3326-minimum-division-operations-to-make-array-non-decreasing/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3326-minimum-division-operations-to-make-array-non-decreasing/Medium | Array, Math, Greedy, Number Theory3334. 找到数组的最大因子分数https://leetcode-solutions-5zk.pages.dev/posts/3334-find-the-maximum-factor-score-of-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3334-find-the-maximum-factor-score-of-array/Medium | Array, Math, Number Theory3336. 寻找 GCD 相等的子序列对数量https://leetcode-solutions-5zk.pages.dev/posts/3336-find-the-number-of-subsequences-with-equal-gcd/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3336-find-the-number-of-subsequences-with-equal-gcd/Hard | Array, Math, Dynamic Programming, Number Theory3377. 数字操作使两个整数相等https://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Path3378. LCM 图中的连通分量数目https://leetcode-solutions-5zk.pages.dev/posts/3378-count-connected-components-in-lcm-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3378-count-connected-components-in-lcm-graph/Hard | Array, Hash Table, Math, Union-Find, Number Theory3411. 乘积等价最长子数组https://leetcode-solutions-5zk.pages.dev/posts/3411-maximum-subarray-with-equal-products/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3411-maximum-subarray-with-equal-products/Easy | Array, Math, Sliding Window, Enumeration, Number Theory3444. 数组中目标倍数的最小增量https://leetcode-solutions-5zk.pages.dev/posts/3444-minimum-increments-for-target-multiples-in-an-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3444-minimum-increments-for-target-multiples-in-an-array/Hard | Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask3461. 检查操作后字符串中的数字是否相等 Ihttps://leetcode-solutions-5zk.pages.dev/posts/3461-check-if-digits-are-equal-in-string-after-operations-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3461-check-if-digits-are-equal-in-string-after-operations-i/Easy | Math, String, Simulation, Combinatorics, Number Theory3463. 检查操作后字符串中的数字是否相等 IIhttps://leetcode-solutions-5zk.pages.dev/posts/3463-check-if-digits-are-equal-in-string-after-operations-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3463-check-if-digits-are-equal-in-string-after-operations-ii/Hard | Math, String, Combinatorics, Number Theory3556. 最大质数子串的和https://leetcode-solutions-5zk.pages.dev/posts/3556-sum-of-largest-prime-substrings/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3556-sum-of-largest-prime-substrings/Medium | Hash Table, Math, String, Sorting, Number Theory3569. 分割后不同质数个数的最大值https://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3569-maximize-count-of-distinct-primes-after-split/Hard | Array, Math, Segment Tree, Number Theory3589. 统计质数间隔平衡的子数组https://leetcode-solutions-5zk.pages.dev/posts/3589-count-prime-gap-balanced-subarrays/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3589-count-prime-gap-balanced-subarrays/Medium | Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue3591. 检查是否有元素的频率为质数https://leetcode-solutions-5zk.pages.dev/posts/3591-check-if-any-element-has-prime-frequency/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3591-check-if-any-element-has-prime-frequency/Easy | Array, Hash Table, Math, Counting, Number Theory3605. 数组的最小稳定性因子https://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3605-minimum-stability-factor-of-array/Hard | Array, Math, Binary Search, Greedy, Segment Tree, Number Theory3618. 按质数索引分割数组https://leetcode-solutions-5zk.pages.dev/posts/3618-split-array-by-prime-indices/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3618-split-array-by-prime-indices/Medium | Array, Math, Number Theory3629. 通过质数传送达到末尾的最小跳跃次数https://leetcode-solutions-5zk.pages.dev/posts/3629-minimum-jumps-to-reach-end-via-prime-teleportation/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3629-minimum-jumps-to-reach-end-via-prime-teleportation/Medium | Array, Hash Table, Math, Breadth-First Search, Number Theory3658. 奇数和偶数和的最大公约数https://leetcode-solutions-5zk.pages.dev/posts/3658-gcd-of-odd-and-even-sums/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3658-gcd-of-odd-and-even-sums/Easy | Math, Number Theory3669. 平衡 K 因数分解https://leetcode-solutions-5zk.pages.dev/posts/3669-balanced-k-factor-decomposition/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3669-balanced-k-factor-decomposition/Medium | Math, Backtracking, Number Theory3671. 美丽子序列的和https://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3671-sum-of-beautiful-subsequences/Hard | Array, Math, Binary Indexed Tree, Number Theory3715. 完全平方祖先节点的和https://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3715-sum-of-perfect-square-ancestors/Hard | Array, Hash Table, Math, Tree, Depth-First Search, Counting, Number Theory3725. 从行中选择互质整数的方案数https://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3725-count-ways-to-choose-coprime-integers-from-rows/Hard | Array, Math, Dynamic Programming, Matrix, Combinatorics, Number Theory3765. 完全质数https://leetcode-solutions-5zk.pages.dev/posts/3765-complete-prime-number/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3765-complete-prime-number/Medium | Math, Enumeration, Number Theory3770. 从连续质数和得到的最大质数https://leetcode-solutions-5zk.pages.dev/posts/3770-largest-prime-from-consecutive-prime-sum/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3770-largest-prime-from-consecutive-prime-sum/Medium | Array, Math, Number Theory3850. 计算到达K的序列数https://leetcode-solutions-5zk.pages.dev/posts/3850-count-sequences-to-k/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3850-count-sequences-to-k/Hard | Array, Math, Dynamic Programming, Memoization, Number Theory3855. 范围内K位数字的和https://leetcode-solutions-5zk.pages.dev/posts/3855-sum-of-k-digit-numbers-in-a-range/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3855-sum-of-k-digit-numbers-in-a-range/Hard | Math, Divide and Conquer, Combinatorics, Number Theory3867. 构成配对的最大公约数之和https://leetcode-solutions-5zk.pages.dev/posts/3867-sum-of-gcd-of-formed-pairs/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3867-sum-of-gcd-of-formed-pairs/Medium | Array, Math, Two Pointers, Simulation, Number Theory3012. 使用操作最小化数组长度https://leetcode-solutions-5zk.pages.dev/posts/3012-minimize-length-of-array-using-operations/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3012-minimize-length-of-array-using-operations/Medium | Array, Math, Greedy, Number Theory3044. 最频繁的质数https://leetcode-solutions-5zk.pages.dev/posts/3044-most-frequent-prime/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3044-most-frequent-prime/Medium | Array, Hash Table, Math, Matrix, Counting, Enumeration, Number Theory3115. 最大质数差https://leetcode-solutions-5zk.pages.dev/posts/3115-maximum-prime-difference/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3115-maximum-prime-difference/Medium | Array, Math, Number Theory3116. 单一面额组合的第K小金额https://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3116-kth-smallest-amount-with-single-denomination-combination/Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theory2654. 使数组所有元素都等于 1 的最少操作次数https://leetcode-solutions-5zk.pages.dev/posts/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1/Medium | Array, Math, Number Theory2709. 最大公约数遍历https://leetcode-solutions-5zk.pages.dev/posts/2709-greatest-common-divisor-traversal/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2709-greatest-common-divisor-traversal/Hard | Array, Math, Union-Find, Number Theory2748. 美丽对的数目https://leetcode-solutions-5zk.pages.dev/posts/2748-number-of-beautiful-pairs/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2748-number-of-beautiful-pairs/Easy | Array, Hash Table, Math, Counting, Number Theory2761. 目标和的质数对https://leetcode-solutions-5zk.pages.dev/posts/2761-prime-pairs-with-target-sum/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2761-prime-pairs-with-target-sum/Medium | Array, Math, Enumeration, Number Theory2807. 在链表中插入最大公约数https://leetcode-solutions-5zk.pages.dev/posts/2807-insert-greatest-common-divisors-in-linked-list/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2807-insert-greatest-common-divisors-in-linked-list/Medium | Linked List, Math, Number Theory2818. 应用操作最大化分数https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2818-apply-operations-to-maximize-score/Hard | Array, Math, Stack, Greedy, Sorting, Monotonic Stack, Number Theory2862. 完整子集的最大元素和https://leetcode-solutions-5zk.pages.dev/posts/2862-maximum-element-sum-of-a-complete-subset-of-indices/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2862-maximum-element-sum-of-a-complete-subset-of-indices/Hard | Array, Math, Number Theory2867. 树中的有效路径数目https://leetcode-solutions-5zk.pages.dev/posts/2867-count-valid-paths-in-a-tree/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2867-count-valid-paths-in-a-tree/Hard | Math, Dynamic Programming, Tree, Depth-First Search, Number Theory2947. 统计美丽子字符串 Ihttps://leetcode-solutions-5zk.pages.dev/posts/2947-count-beautiful-substrings-i/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2947-count-beautiful-substrings-i/Medium | Hash Table, Math, String, Enumeration, Number Theory, Prefix Sum2949. 统计美丽子字符串 IIhttps://leetcode-solutions-5zk.pages.dev/posts/2949-count-beautiful-substrings-ii/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2949-count-beautiful-substrings-ii/Hard | Hash Table, Math, String, Number Theory, Prefix Sum2001. 可互换矩形的组数https://leetcode-solutions-5zk.pages.dev/posts/2001-number-of-pairs-of-interchangeable-rectangles/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2001-number-of-pairs-of-interchangeable-rectangles/Medium | Array, Hash Table, Math, Counting, Number Theory2117. 区间乘积的缩写https://leetcode-solutions-5zk.pages.dev/posts/2117-abbreviating-the-product-of-a-range/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2117-abbreviating-the-product-of-a-range/Hard | Math, Number Theory2183. 统计被 K 整除的下标对数目https://leetcode-solutions-5zk.pages.dev/posts/2183-count-array-pairs-divisible-by-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2183-count-array-pairs-divisible-by-k/Hard | Array, Hash Table, Math, Counting, Number Theory2197. 替换数组中的非互质数https://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2197-replace-non-coprime-numbers-in-array/Hard | Array, Math, Stack, Number Theory2221. 数组的三角和https://leetcode-solutions-5zk.pages.dev/posts/2221-find-triangular-sum-of-an-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2221-find-triangular-sum-of-an-array/Medium | Array, Math, Simulation, Combinatorics, Number Theory2280. 表示折线图所需的最少线段数https://leetcode-solutions-5zk.pages.dev/posts/2280-minimum-lines-to-represent-a-line-chart/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2280-minimum-lines-to-represent-a-line-chart/Medium | Array, Math, Geometry, Sorting, Number Theory2344. 最少删除使数组可被整除https://leetcode-solutions-5zk.pages.dev/posts/2344-minimum-deletions-to-make-array-divisible/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2344-minimum-deletions-to-make-array-divisible/Hard | Array, Math, Sorting, Heap (Priority Queue), Number Theory2413. 最小偶数倍数https://leetcode-solutions-5zk.pages.dev/posts/2413-smallest-even-multiple/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2413-smallest-even-multiple/Easy | Math, Number Theory2427. 公因数的数目https://leetcode-solutions-5zk.pages.dev/posts/2427-number-of-common-factors/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2427-number-of-common-factors/Easy | Math, Enumeration, Number Theory2447. 最大公约数等于 K 的子数组数目https://leetcode-solutions-5zk.pages.dev/posts/2447-number-of-subarrays-with-gcd-equal-to-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2447-number-of-subarrays-with-gcd-equal-to-k/Medium | Array, Math, Number Theory2470. 最小公倍数为 K 的子数组数目https://leetcode-solutions-5zk.pages.dev/posts/2470-number-of-subarrays-with-lcm-equal-to-k/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2470-number-of-subarrays-with-lcm-equal-to-k/Medium | Array, Math, Number Theory2507. 质因数分解后的最小值https://leetcode-solutions-5zk.pages.dev/posts/2507-smallest-value-after-replacing-with-sum-of-prime-factors/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2507-smallest-value-after-replacing-with-sum-of-prime-factors/Medium | Math, Simulation, Number Theory2513. 最小化两个数组的最大值https://leetcode-solutions-5zk.pages.dev/posts/2513-minimize-the-maximum-of-two-arrays/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2513-minimize-the-maximum-of-two-arrays/Medium | Math, Binary Search, Number Theory2521. 数组元素乘积的不同质因数的数目https://leetcode-solutions-5zk.pages.dev/posts/2521-distinct-prime-factors-of-product-of-array/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2521-distinct-prime-factors-of-product-of-array/Medium | Array, Hash Table, Math, Number Theory2523. 区间内最近的两个质数https://leetcode-solutions-5zk.pages.dev/posts/2523-closest-prime-numbers-in-range/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2523-closest-prime-numbers-in-range/Medium | Math, Number Theory2543. 检查点是否可达https://leetcode-solutions-5zk.pages.dev/posts/2543-check-if-point-is-reachable/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2543-check-if-point-is-reachable/Hard | Math, Number Theory2572. 无平方子集的数目https://leetcode-solutions-5zk.pages.dev/posts/2572-count-the-number-of-square-free-subsets/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2572-count-the-number-of-square-free-subsets/Medium | Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask2584. 分割数组使乘积互质https://leetcode-solutions-5zk.pages.dev/posts/2584-split-the-array-to-make-coprime-products/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2584-split-the-array-to-make-coprime-products/Hard | Array, Hash Table, Math, Number Theory2601. 质数减法操作https://leetcode-solutions-5zk.pages.dev/posts/2601-prime-subtraction-operation/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2601-prime-subtraction-operation/Medium | Array, Math, Binary Search, Greedy, Number Theory2607. 使 K 子数组和相等https://leetcode-solutions-5zk.pages.dev/posts/2607-make-k-subarray-sums-equal/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2607-make-k-subarray-sums-equal/Medium | Array, Math, Greedy, Sorting, Number Theory2614. 对角线上的质数https://leetcode-solutions-5zk.pages.dev/posts/2614-prime-in-diagonal/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2614-prime-in-diagonal/Easy | Array, Math, Matrix, Number Theory1492. n 的第 k 个因子https://leetcode-solutions-5zk.pages.dev/posts/1492-the-kth-factor-of-n/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1492-the-kth-factor-of-n/Medium | Math, Number Theory1622. 花式序列https://leetcode-solutions-5zk.pages.dev/posts/1622-fancy-sequence/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1622-fancy-sequence/Hard | Math, Design, Segment Tree, Number Theory1627. 图的连通性与阈值https://leetcode-solutions-5zk.pages.dev/posts/1627-graph-connectivity-with-threshold/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1627-graph-connectivity-with-threshold/Hard | Array, Math, Union-Find, Number Theory1735. 构造乘积数组的方案数https://leetcode-solutions-5zk.pages.dev/posts/1735-count-ways-to-make-array-with-product/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1735-count-ways-to-make-array-with-product/Hard | Array, Math, Dynamic Programming, Combinatorics, Number Theory1766. 互质树https://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1766-tree-of-coprimes/Hard | Array, Math, Tree, Depth-First Search, Number Theory1799. N 次操作后的最大分数和https://leetcode-solutions-5zk.pages.dev/posts/1799-maximize-score-after-n-operations/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1799-maximize-score-after-n-operations/Hard | Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask1808. 最大化优雅除数的数目https://leetcode-solutions-5zk.pages.dev/posts/1808-maximize-number-of-nice-divisors/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1808-maximize-number-of-nice-divisors/Hard | Math, Recursion, Number Theory1952. 三个除数https://leetcode-solutions-5zk.pages.dev/posts/1952-three-divisors/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1952-three-divisors/Easy | Math, Enumeration, Number Theory1979. 找数组的最大公约数https://leetcode-solutions-5zk.pages.dev/posts/1979-find-greatest-common-divisor-of-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1979-find-greatest-common-divisor-of-array/Easy | Array, Math, Number Theory1998. 数组的 GCD 排序https://leetcode-solutions-5zk.pages.dev/posts/1998-gcd-sort-of-an-array/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1998-gcd-sort-of-an-array/Hard | Array, Math, Union-Find, Sorting, Number Theory1201. 丑数 IIIhttps://leetcode-solutions-5zk.pages.dev/posts/1201-ugly-number-iii/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1201-ugly-number-iii/Medium | Math, Binary Search, Combinatorics, Number Theory1250. 检查是否为好数组https://leetcode-solutions-5zk.pages.dev/posts/1250-check-if-it-is-a-good-array/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1250-check-if-it-is-a-good-array/Hard | Array, Math, Number Theory858. 镜面反射https://leetcode-solutions-5zk.pages.dev/posts/0858-mirror-reflection/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0858-mirror-reflection/Medium | Math, Geometry, Number Theory866. 回文质数https://leetcode-solutions-5zk.pages.dev/posts/0866-prime-palindrome/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0866-prime-palindrome/Medium | Math, Number Theory914. 卡牌分组https://leetcode-solutions-5zk.pages.dev/posts/0914-x-of-a-kind-in-a-deck-of-cards/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0914-x-of-a-kind-in-a-deck-of-cards/Easy | Array, Hash Table, Math, Counting, Number Theory952. 按公因数计算最大组件大小https://leetcode-solutions-5zk.pages.dev/posts/0952-largest-component-size-by-common-factor/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0952-largest-component-size-by-common-factor/Hard | Array, Hash Table, Math, Union-Find, Number Theory204. 计数质数https://leetcode-solutions-5zk.pages.dev/posts/0204-count-primes/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0204-count-primes/Medium | Array, Math, Enumeration, Number Theory258. 各位数字相加https://leetcode-solutions-5zk.pages.dev/posts/0258-add-digits/Fri, 17 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0258-add-digits/Easy | Math, Simulation, Number Theory