ljffdream的专栏

【题目】 Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without u

【题目】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

【题目】 Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.

[题目] Given an integer, write a function to determine if it is a power of two. [思路] 这道题的思路还是蛮简单的说,0的时候是false,不可能是2 的倍数。 8/2 =4 4/2 =2 2/2 =1。最后肯定是得1。 7%2 ！=0不能被2整除肯定是不行的。 [代码] public class S