位运算

两数相除

Solve Divide Two Integers by turning repeated subtraction into bit-shifted chunk subtraction with careful sign and overf…

二进制求和

Add Binary involves summing two binary strings and returning the result as a binary string using math and string manipul…

子集

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

格雷编码

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…

只出现一次的数字

Solve the Single Number problem using an efficient approach with constant space and linear time complexity.

只出现一次的数字 II

Find the single element in an array where every other element appears three times, using bit manipulation and constant s…

重复的DNA序列

Solve Repeated DNA Sequences by sliding a length-10 window and tracking seen patterns with a hash set or bitmask.

颠倒二进制位

Reverse a 32-bit unsigned integer by manipulating bits efficiently using a divide and conquer approach with careful bit …

位1的个数

Number of 1 Bits is a classic bit manipulation problem where clearing the lowest set bit gives the cleanest count.

数字范围按位与

Use shared high bits and bit clearing to solve Bitwise AND of Numbers Range without scanning every value.

完全二叉树的节点个数

Count Complete Tree Nodes efficiently by leveraging binary-tree traversal, exploiting completeness, and applying bit man…

2 的幂

Determine if a given integer is a power of two using efficient math and bit manipulation techniques with optional recurs…

只出现一次的数字 III

Find the two unique numbers in an array where all other numbers appear exactly twice using bit manipulation efficiently.

丢失的数字

Find the missing number in an array containing distinct numbers in the range [0, n].

寻找重复数

The problem involves finding the duplicate number in an array of integers, using a binary search approach over the valid…

最大单词长度乘积

The problem requires finding the maximum product of lengths of two words from an array, where the words don't share comm…

比特位计数

Compute the number of 1 bits for every integer from 0 to n using state transition dynamic programming for efficiency.

4的幂

Determine if a given integer is a power of four using math insights and bit manipulation tricks efficiently in code.

两整数之和

Solve the Sum of Two Integers problem using bit manipulation and math to avoid using the operators + and -.

找不同

Find the Difference involves identifying the additional letter in one string compared to another, emphasizing hash table…

UTF-8 编码验证

Determine if an integer array represents valid UTF-8 encoding based on its byte sequences using bit manipulation.

整数替换

Find the minimum number of operations to reduce a number to 1 by applying specific operations, using state transition dy…

二进制手表

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