feat: add 070

Author: Blankj

README.md

@@ -21,7 +21,9 @@
 |53|[Maximum Subarray][053]|Array, Dynamic Programming, Divide and Conquer|
 |58|[Length of Last Word][058]|String|
 |66|[Plus One][066]|Array, Math|
+|67|[Add Binary][067]|Math, String|
 |69|[Sqrt(x)][069]|Binary Search, Math|
+|70|[Climbing Stairs][070]|Dynamic Programming|
 
 
 ## Medium
@@ -61,4 +63,6 @@
 [053]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/053/README.md
 [058]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/058/README.md
 [066]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/066/README.md
+[067]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/067/README.md
 [069]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/069/README.md
+[070]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/070/README.md

note/067/README.md

@@ -1,4 +1,4 @@
-# [Plus One][title]
+# [Add Binary][title]
 
 ## Description
 
@@ -14,7 +14,7 @@ Return `"100"`.
 
 ## 思路
 
-题意是给你两个二进制串，求其和的二进制串。
+题意是给你两个二进制串，求其和的二进制串。我们就按照小学算数那么来做，用`carry`表示进位，从后往前算，依次往前，每算出一位就插入到最前面即可，直到把两个二进制串都遍历完即可。
 
 ``` java
 public class Solution {
@@ -52,5 +52,5 @@ public class Solution {
 
 
 
-[title]: https://leetcode.com/problems/plus-one
+[title]: https://leetcode.com/problems/add-binary
 [ajl]: https://github.com/Blankj/awesome-java-leetcode

note/069/README.md

@@ -11,7 +11,7 @@ Compute and return the square root of x.
 
 ## 思路
 
-题意是求平方根，参考[牛顿迭代法求平方根](https://wenku.baidu.com/view/6b74c622bcd126fff7050bfe.html)，我们就可以高效低实现了。
+题意是求平方根，参考[牛顿迭代法求平方根](https://wenku.baidu.com/view/6b74c622bcd126fff7050bfe.html)，然后再参考维基百科的[Integer square root](https://en.wikipedia.org/wiki/Integer_square_root#Using_only_integer_division)即可。
 
 ``` java
 public class Solution {

note/070/README.md

@@ -0,0 +1,39 @@
+# [Climbing Stairs][title]
+
+## Description
+
+You are climbing a stair case. It takes *n* steps to reach to the top.
+
+Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
+
+**Note:** Given *n* will be a positive integer.
+
+**Tags:** Binary Search, Math
+
+
+## 思路
+
+题意是爬楼梯，每次你只能爬一步或者两步，问到顶层共有多少种方案。我们假设到顶层共有`f(n)`种，那么`f(n) = f(n - 1) + f(n - 2)`肯定是成立的，意思就是我们迈向顶层的最后一步是在倒数第一级台阶或者在倒数第二级台阶。算法我对空间复杂度进行了优化，因为在迭代过程中只需要两个变量即可。
+
+``` java
+public class Solution {
+    public int climbStairs(int n) {
+        int a = 1, b = 1;
+        while (--n > 0) {
+            b += a;
+            a = b - a;
+        }
+        return b;
+    }
+}
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/climbing-stairs
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_069/Solution.java

@@ -20,6 +20,6 @@ public int mySqrt(int x) {
 
     public static void main(String[] args) {
         Solution solution = new Solution();
-        System.out.println(solution.mySqrt(11));
+        System.out.println(solution.mySqrt(10));
     }
 }

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_070/Solution.java

@@ -0,0 +1,26 @@
+package com.blankj.easy._070;
+
+/**
+ * <pre>
+ *     author: Blankj
+ *     blog  : http://blankj.com
+ *     time  : 2017/05/09
+ *     desc  :
+ * </pre>
+ */
+
+public class Solution {
+    public int climbStairs(int n) {
+        int a = 1, b = 1;
+        while (--n > 0) {
+            b += a;
+            a = b - a;
+        }
+        return b;
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.climbStairs(3));
+    }
+}