20160929

开始刷加锁的题目

Author: SmokerX

README.md

@@ -155,6 +155,7 @@
 |153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|Medium|noNote|[Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/153. Find Minimum in Rotated Sorted Array/Solution.java)|no|no|no|no|
 |154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)|Hard|noNote|[Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/154. Find Minimum in Rotated Sorted Array II/Solution.java)|no|no|no|no|
 |155|[Min Stack](https://leetcode.com/problems/min-stack/)|Easy|noNote|[Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/155. Min Stack/Solution.java)|no|no|no|no|
+|156|[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/)|Medium|noNote|[Java](https://github.com/corpsepiges/leetcode/blob/master/Algorithms/156. Binary Tree Upside Down/Solution.java)|no|no|no|no|
 |157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/)|Easy|noNote|no|no|no|no|no|
 |158|[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/)|Hard|noNote|no|no|no|no|no|
 |159|[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/)|Hard|noNote|no|no|no|no|no|