update doc

stevencooks · stevencooks · commit 8848c5a114cc · 2015-10-05T10:57:31.000-04:00
diff --git a/README.md b/README.md
@@ -260,6 +260,7 @@ P.S.:
 | 240 | [Search a 2D Matrix II](https://github.com/interviewcoder/leetcode/blob/master/src/_240_SearchA2DMatrixII/Solution.java)  | Medium | `Divide and Conquer` `Binary Search`  | | 
 | 241 | Different Ways to Add Parentheses | Medium | `Divide and Conquer`  |  | 
 | 242 | [Valid Anagram](https://github.com/interviewcoder/leetcode/blob/master/src/_242_ValidAnagram/Solution.java) | Easy | `Hash Table` `Sort`  |  | 
+| 246 | [Strobogrammatic Number](https://github.com/interviewcoder/leetcode/blob/master/src/_246_StrobogrammaticNumber/Solution.java) | Easy | `Hash Table` `Math` |  |
 | 251 | [Flatten2DVector](https://github.com/interviewcoder/leetcode/tree/master/src/_251_Flatten2DVector) | Medium | `Design` | |
 | 252 | [Meeting Rooms](https://github.com/interviewcoder/leetcode/tree/master/src/_252_MeetingRooms) | Easy | `Sort` | |
 | 253 | [Meeting Rooms II](https://github.com/interviewcoder/leetcode/tree/master/src/_253_MeetingRoomsII) | Medium | `Heap` `Greedy` `Sort` | |
diff --git a/doc/category_binarysearch.md b/doc/category_binarysearch.md
@@ -0,0 +1,5 @@
+#### Category : : Binary Search
+
+| Type         | # | Description |
+| ---------------------: |:---:| :------------|
+| matrix | 240 | [Search A 2D Matrix II](https://github.com/interviewcoder/leetcode/blob/master/src/_240_SearchA2DMatrixII/Solution.java) |
diff --git a/doc/category_dp.md b/doc/category_dp.md
@@ -4,16 +4,16 @@
 
     |  |  |  | |
     | ---------------------: |:---:| :-----:| :--- |
-    | 1 sequence : boolean(*) | 139 | [Word Break](https://github.com/interviewcoder/leetcode/tree/master/src/_139_WordBreak) |  |
+    | 1 sequence : boolean(*) | 139 | [Word Break](https://github.com/interviewcoder/leetcode/tree/master/src/_139_WordBreak) | O(2^n) -> O(N^2) |
     | 1 sequence : `max`/min(*) | 198 | House Robber |  |
     | 1 sequence : `max`/min(*) | 213 | [House Robber II](https://github.com/interviewcoder/leetcode/tree/master/src/_213_HouseRobberII) |  | 
-    | 1 sequence : `max`/min(*) | 053 | [Maximum Subarray](https://github.com/interviewcoder/leetcode/tree/master/src/_053_MaximumSubarray) | |
-    | 1 sequence : `max`/min(*) | 152 | [Maximum Product Subarray](https://github.com/interviewcoder/leetcode/blob/master/src/_152_MaximumProductSubarray/Solution.java) | global V.S. local |
+    | 1 sequence : `max`/min(*) | 053 | [Maximum Subarray](https://github.com/interviewcoder/leetcode/tree/master/src/_053_MaximumSubarray) | global V.S. local, O(N^3) -> O(N) |
+    | 1 sequence : `max`/min(*) | 152 | [Maximum Product Subarray](https://github.com/interviewcoder/leetcode/blob/master/src/_152_MaximumProductSubarray/Solution.java) | global V.S. local, O(N^3) -> O(N) |
     | 1 sequence : max/`min`(*) | 132 | [Palindrome Partitioning II](https://github.com/interviewcoder/leetcode/tree/master/src/_132_PalindromePartitioningII) | |
     | 1 sequence : `max`/min(*) | 032 | [Longest Valid Parentheses](https://github.com/interviewcoder/leetcode/tree/master/src/_032_LongestValidParentheses) | global V.S. local |
-    | 1 sequence : `max`/min(*) | 121 | Best Time to Buy and Sell Stock | |
+    | 1 sequence : `max`/min(*) | 121 | Best Time to Buy and Sell Stock | O(N^2) -> O(N) |
     | 1 sequence : `max`/min(*) | 123 | Best Time to Buy and Sell Stock III | |
-    | 1 sequence : count(*) | 091 | [Decode Ways](https://github.com/interviewcoder/leetcode/tree/master/src/_091_DecodeWays) | |
+    | 1 sequence : count(*) | 091 | [Decode Ways](https://github.com/interviewcoder/leetcode/tree/master/src/_091_DecodeWays) | O(N^2) -> O(N) |
     | 1 sequence : all(*) | 140 | Word Break II: dp + backtracking | |
 
 
