Merge pull request #203 from lightfish-zhang/master

 add Solution 70,198 for golang

Author: yanglbme

solution/0070.Climbing Stairs/Solution.go

@@ -0,0 +1,10 @@
+func climbStairs(n int) int {
+	if n < 3 {
+		return n
+	}
+	x, y := 1, 2
+	for i := 2; i < n; i++ {
+		x, y = y, x+y
+	}
+	return y
+}

solution/0198.House Robber/Solution.go

@@ -0,0 +1,15 @@
+/*
+198.House Robber
+动态规划的思路，找到状态转移方程 `f(n) = max(f(n-2)+nums[n], f(n-1))` ，初始值为 `f(0)=0, f(1)=nums[1]`
+*/
+
+func rob(nums []int) int {
+	x, y := 0, 0
+	for _, n := range nums {
+		x, y = y, x+y
+		if x > y {
+			y = x
+		}
+	}
+	return y
+}