bit-manipulation
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
751. IP to CIDR
Given a start IP address ip and a number of ips we need to cover n, return a representation of the range as a list (of smallest possible length) of CIDR blocks.A CIDR block is a string consistin原创 2017-12-25 18:11:18 · 404 阅读 · 0 评论 -
137. Single Number II
Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.Note:Your algorithm should have a linear runtime complexity....原创 2018-08-05 11:42:23 · 231 阅读 · 0 评论 -
201. Bitwise AND of Numbers Range
Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.Example 1:Input: [5,7]Output: 4Example 2:Input: [0,1]Output: ...原创 2018-08-06 20:19:16 · 114 阅读 · 0 评论 -
898. Bitwise ORs of Subarrays
We have an array A of non-negative integers.For every (contiguous) subarray B = [A[i], A[i+1], ..., A[j]] (with i <= j), we take the bitwise OR of all the elements in B, obtaining a result A[i] |...原创 2018-09-02 11:32:04 · 388 阅读 · 0 评论 -
982. Triples with Bitwise AND Equal To Zero
Given an array of integers A, find the number of triples of indices (i, j, k) such that:0 <= i < A.length 0 <= j < A.length 0 <= k < A.length A[i] & A[j] & A[k] == 0, wh...原创 2019-01-27 18:16:55 · 339 阅读 · 0 评论