kunpeng

玩命加载中 . . .

学习之旅

                            
                            338-比特位计数
                        
                                LeetCode 338. Counting BitsGiven an integer n, return an array ans of length n + 1 such that for each i (0 <= i <=
                            
                                2021-12-03
                            
                                    LeetCode
                                
                            位运算
                        
                            263-丑数
                        
                                LeetCode 263. Ugly NumberLeetCode-263
An ugly number is a positive integer whose prime factors are limited to 2, 3, and 
                            
                                2021-12-03
                            
                                    LeetCode
                                
                            数学
                        
                            392/524-判断子序列
                        
                                LeetCode 392. Is SubsequenceGiven two strings s and t, return true if s is a subsequence of t, or false otherwise.
Examp
                            
                                2021-12-02
                            
                                    LeetCode
                                
                            双指针
                        
                            201-数字范围按位与
                        
                                LeetCode 201. Bitwise AND of Numbers RangeLeetCode-201
Given two integers left and right that represent the range [left,
                            
                                2021-12-02
                            
                                    LeetCode
                                
                            位运算
                        
                            268-丢失的数字
                        
                                LeetCode 268. Missing NumberLeetCode-268
Given an array nums containing n distinct numbers in the range [0, n], return t
                            
                                2021-12-02
                            
                                    LeetCode
                                
                            位运算
                        
                            190-颠倒二进制位
                        
                                LeetCode 190. Reverse BitsLeetCode-190
Reverse bits of a given 32 bits unsigned integer.
Example 1:Input: n = 0000001010
                            
                                2021-12-01
                            
                                    LeetCode
                                
                            位运算
                        
                            67-二进制求和
                        
                                LeetCode 67. Add BinaryGiven two binary strings a and b, return their sum as a binary string.
Example 1:Input: a = "11",
                            
                                2021-12-01
                            
                                    LeetCode
                                
                            位运算
                        
                            371-两整数之和
                        
                                LeetCode 371. Sum of Two IntegersGiven two integers a and b, return the sum of the two integers without using the operat
                            
                                2021-12-01
                            
                                    LeetCode
                                
                            位运算
                        
                            476-数字的补数
                        
                                LeetCode 476. Number ComplementThe complement of an integer is the integer you get when you flip all the 0’s to 1’s and 
                            
                                2021-11-30
                            
                                    LeetCode
                                
                            位运算
                        
                            762-二进制表示中质数个计算置位
                        
                                LeetCode 762. Prime Number of Set Bits in Binary RepresentationGiven two integers left and right, return the count of nu
                            
                                2021-11-30
                            
                                    LeetCode
                                
                            位运算
                        
                            136/137/260-只出现1次的数字
                        
                                LeetCode 136. Single NumberGiven a non-empty array of integers nums, every element appears twice except for one. Find th
                            
                                2021-11-30
                            
                                    LeetCode
                                
                            位运算
                        
                            231-2的幂
                        
                                LeetCode 231. Power of TwoGiven an integer n, return true if it is a power of two. Otherwise, return false.
An integer n
                            
                                2021-11-30
                            
                                    LeetCode
                                
                            位运算

            
21 / 43