位操作
黑猫崽儿
我能吞下玻璃而不伤身体。
展开
-
Leetcode.Bit Manipulation.位运算专题.(持续更新)
Number of 1 BitsPower of TwoReverse BitsSingle NumberSingle Number IISingle Number IIIMissing NumberBitwise AND of Numbers RangeRepeated DNA Sequences原创 2015-12-03 20:40:43 · 1575 阅读 · 0 评论 -
【题解】Leetcode.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.题目大意: 不使用+和-操作符计算两int和思路: 位操作模拟2进制运算实现:// 实现 a// 从最右边的位原创 2016-07-29 21:17:14 · 727 阅读 · 0 评论 -
【题解】Leetcode.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 only lower case le原创 2016-07-30 20:18:35 · 641 阅读 · 0 评论 -
【题解】Leetcode.78.Subsets
Describe Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,3], a solution is: [ [3原创 2016-08-04 22:18:40 · 695 阅读 · 0 评论 -
【题解】QDUOJ.94.ltwy的比特绷板键盘
题目: https://qduoj.com/problem/94/主要考察模拟2进制的置位和复位,其中有些细节需要注意:i的范围是[1,32768],也就是说输出结果的范围是[0, 2^32767], 所以只用一个整型变量存储是不行的,要用数组模拟大数。对于”调皮的操作”,需要考虑的全面一些,诸如: pRint printf set 1 1 reset 1i p原创 2016-08-13 19:59:54 · 1917 阅读 · 0 评论