## leetcode Counting Bits

Given a non negative integer number

num. For every numbersiin the range0 ≤ i ≤ numcalculate the number of 1’s in their binary representation and return them as an array.

Example:

For`num = 5`

you should return`[0,1,1,2,1,2]`

.

Follow up:

- It is very easy to come up with a solution with run time
O(n*sizeof(integer)). But can you do it in linear timeO(n)/possibly in a single pass?- Space complexity should be
O(n).- Can you do it like a boss? Do it without using any builtin function like
__builtin_popcountin c++ or in any other language.

# Month: March 2016

## leetcode House Robber III

## leetcode House Robber III

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that “all houses in this place forms a binary tree”. It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

Example 1:

12345 3/ \2 3\ \3 1Maximum amount of money the thief can rob = 3 + 3 + 1 =

7.

Example 2:

12345 3/ \4 5/ \ \1 3 1Maximum amount of money the thief can rob = 4 + 5 =

9.