# [LeetCode 600] Non-negative Integers without Consecutive Ones [Java]

**2017-09-14

1. Description Given a positive integer n, find the number of non-negative integers less than or equal to n, whose binary representations do NOT co...

1. Description Given a positive integer n, find the number of non-negative integers less than or equal to n, whose binary representations do NOT co...

1. Description Implement pow(x, n). 2. Runtime Distribution 3. Submission Details 4. Example Input 16 Output: True 5. Code [restabs alignme...

1. Description Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. For e...

1. Description Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 0000001010010100000111...

1. Description Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight). For ex...

1. Description Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note...

1. Description Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a lin...