小榕流光的专栏

题目链接：https://leetcode.com/problems/single-number/Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runti

给一个整数数组，求数组中两个元素异或的最大值．思路：naive的做法是两两异或求最大值，时间复杂度为O(n＊n)，但是还有一种O(n)的解法，利用字典树Trie来实现．其思路是利用数组中的每个元素二进制表示形式建一棵树，我看到网上大多数解法都开了太大的数组空间，不知道为什么，但是我觉得没有必要．只要用现有的数组元素二进制值建一棵深度为33的树即可，从根到叶子结点的路径就代表了一个元

题目链接: https://leetcode.com/problems/find-the-difference/Given two strings s and t which consist of only lowercase letters.String t is generated by random shuffling string s and then add one

题目链接：https://leetcode.com/problems/utf-8-validation/A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:For 1-byte character, the first bit is a 0, followed b

题目链接：https://leetcode.com/problems/single-number-iii/Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the tw

题目链接：https://leetcode.com/problems/reverse-bits/Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100)

题目链接: https://leetcode.com/problems/maximum-product-of-word-lengths/Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share com

题目链接: https://leetcode.com/problems/number-of-1-bits/Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For exampl

题目链接：https://leetcode.com/problems/valid-sudoku/Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are fil

题目链接：https://leetcode.com/problems/single-number-ii/Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a lin

题目链接：https://leetcode.com/problems/missing-number/Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given n

题目链接: https://leetcode.com/problems/counting-bits/Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation

题目链接: https://leetcode.com/problems/bitwise-and-of-numbers-range/Given a range [m, n] where 0 For example, given the range [5, 7], you should return 4.思路: 有两种思路来做这题, 第一种是从后往前每次 n = (

题目链接: https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231.Find the maximum result of ai XOR