house_robber && number_of_1bits

Author: hitzzc

README.md

@@ -155,6 +155,9 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [187. Repeated DNA Sequences](https://github.com/hitzzc/go-leetcode/tree/master/repeated_dna_sequences)
 #### [189. Rotate Array](https://github.com/hitzzc/go-leetcode/tree/master/rotate_array)
 #### [190. Reverse Bits](https://github.com/hitzzc/go-leetcode/tree/master/reverse_bits)
+#### [191. Number of 1 Bits](https://github.com/hitzzc/go-leetcode/tree/master/number_of_1bits)
+#### [198. House Robber](https://github.com/hitzzc/go-leetcode/tree/master/house_robber)
+
 
 
 

house_robber/house_robber.go

@@ -0,0 +1,25 @@
+package house_robber
+
+func rob(nums []int) int {
+	if len(nums) == 0 {
+		return 0
+	}
+	if len(nums) == 1 {
+		return nums[0]
+	}
+	array := make([]int, len(nums))
+	array[0] = nums[0]
+	if array[0] > nums[1] {
+		array[1] = array[0]
+	} else {
+		array[1] = nums[1]
+	}
+	for i := 2; i < len(nums); i++ {
+		if array[i-1] > array[i-2]+nums[i] {
+			array[i] = array[i-1]
+		} else {
+			array[i] = array[i-2] + nums[i]
+		}
+	}
+	return array[len(array)-1]
+}

number_of_1bits/number_of_1bits.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int hammingWeight(uint32_t n) {
+        int x = 1;
+        int count = 0;
+        for (int i = 0; i < 32; ++i){
+        	if (n & x) count++;
+        	x <<= 1;
+        }
+        return count;
+    }
+};