leetcode整理 Bit Manipulation
StudyCoder
这个作者很懒,什么都没留下…
展开
-
191. Number of 1 Bits
题意:1的位数Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary represen转载 2016-07-26 22:43:36 · 265 阅读 · 0 评论 -
371. Sum of Two Integers
题目:两个整数的和Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3.题意:计算两个整数a和b的和,但是不允许使用+、-计算操作符。思转载 2016-07-26 23:20:06 · 277 阅读 · 0 评论 -
190. Reverse Bits
题目:逆位Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary a转载 2016-07-27 21:22:26 · 243 阅读 · 0 评论 -
342. Power of Four
题目:判断是否是4的N次方Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example:Given num = 16, return true. Given num = 5, return false.Follow up: Could y转载 2016-07-27 22:01:09 · 319 阅读 · 0 评论 -
318. 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 common letters. You may assume that each word will contain o转载 2016-07-27 22:30:13 · 248 阅读 · 0 评论 -
137. Single Number II
题目:单个数字2Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement转载 2016-07-27 23:22:17 · 258 阅读 · 0 评论 -
201. Bitwise AND of Numbers Range
题目:数字范围位相与Given a range [m, n] where 0 For example, given the range [5, 7], you should return 4.题意:给定一个范围[m,n],0 转载:http://www.cnblogs.com/grandyang/p/4431646.html思路一:从题目中给的例转载 2016-07-28 09:42:05 · 382 阅读 · 0 评论 -
260. Single Number III
题目:单个数字3Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For exam转载 2016-07-28 10:43:24 · 272 阅读 · 0 评论