bit
文章平均质量分 54
mynotwo
这个作者很懒,什么都没留下…
展开
-
260. 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 two elements that appear only once. For example: Given nums =原创 2017-05-12 10:16:25 · 167 阅读 · 0 评论 -
191. 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 example, the 32-bit integer ’11' has binary representation 00000000原创 2016-05-19 12:00:23 · 168 阅读 · 0 评论 -
7. Reverse Integer&&190. Reverse Bits
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 思路:并没有什么特殊的……用一个long int来防止溢出并检验溢出 class Solution { public: int reverse(int x) { int n=原创 2016-05-24 11:05:03 · 170 阅读 · 0 评论