Add tags

awangdev · awangdev · commit a85bb1f24bd7 · 2018-03-11T01:23:23.000-08:00
diff --git a/Java/2 Sum II - Input array is sorted.java b/Java/2 Sum II - Input array is sorted.java
@@ -1,5 +1,6 @@
 M
 1516439332
+tags: Array, Two Pointers, Binary Search
 
 排序好的array. Two pointer移动start和end，核查sum.
 注意sum用long.
diff --git a/Java/2 Sum II.java b/Java/2 Sum II.java
@@ -1,5 +1,7 @@
 M
 1516439472
+tags: Array, Two Pointers, Binary Search
+
 与 2sum II - input array is sorted类似. 都是sort array, 然后two pointer.
 
 LintCode的题. 注意找的是greater/bigger than target。
diff --git a/Java/2 Sum.java b/Java/2 Sum.java
@@ -1,5 +1,7 @@
 E
 1516438794
+tags: Array, Hash Table
+
 tutorial:https://www.youtube.com/watch?v=P8zBxoVY1oI&feature=youtu.be
 
 解法1：相对暴力简洁, HashMap<value, index>，找到一个value, 存一个; 若在HashMap里面 match 到结果, 就return HashMap里存的index. O(n) space && time.
diff --git a/Java/3 Sum Closest.java b/Java/3 Sum Closest.java
@@ -1,5 +1,6 @@
 M
 1516610949
+tags: Array, Two Pointers
 
 3Sum 的一种简单形式, 并且都没有找index, value, 而只是找个sum罢了.
 
diff --git a/Java/3 Sum Smaller.java b/Java/3 Sum Smaller.java
@@ -1,5 +1,6 @@
 M
 1517465602
+tags: Two Pointers, Array
 
 一般的O(n3)肯定不行。在此基础上优化。
 发现j,k满足条件时候，(k - j)就是所有 sum <target的情况了。
diff --git a/Java/3 Sum.java b/Java/3 Sum.java
@@ -1,5 +1,6 @@
 M
 1516689562
+tags: Array, Two Pointers
 
 方法1:
 sort array, for loop + two pointer. O(n)
diff --git a/Java/4 Sum.java b/Java/4 Sum.java
@@ -1,5 +1,6 @@
 M
 1516696879
+tags: Hash Table
 
 方法1：  
    1. 利用2Sum的原理，把4Sum分为连个2Sum。左一个pair,右一个pair，每个pair里面放2个数字。   
diff --git a/Java/Best Time to Buy and Sell Stock I.java b/Java/Best Time to Buy and Sell Stock I.java
@@ -1,5 +1,6 @@
 E
 1517372448
+tags: Array, DP
 
 理解意思是关键:
    每天都就交易价格，n天只让买卖一次，那就找个最低价买进，找个最高价卖出。
diff --git a/Java/Best Time to Buy and Sell Stock II.java b/Java/Best Time to Buy and Sell Stock II.java
@@ -1,5 +1,7 @@
 E
 1517373801
+tags: Array, Greedy
+
 和Stock I 的区别：可以买卖多次，求总和的最大盈利。
 
 这道题有几种其他不同的思路:
diff --git a/Java/Best Time to Buy and Sell Stock III .java b/Java/Best Time to Buy and Sell Stock III .java
@@ -1,5 +1,6 @@
 H
 1517376279
+tags: Array, DP
 
 比stock II 多了一个限制：只有2次卖出机会。
 
diff --git a/Java/Best Time to Buy and Sell Stock IV.java b/Java/Best Time to Buy and Sell Stock IV.java
@@ -1,5 +1,6 @@
 H
 1517379489
+tags: DP
 
 方法1:
 DP. 根据StockIII, 不难发现StockIV就是把状态划分为2k+1份. 那么同样的代码, 移植.
diff --git a/Java/Bomb Enemy.java b/Java/Bomb Enemy.java
@@ -1,5 +1,6 @@
 M
 1517296407
+tags: DP
 
 分方向考虑的方法很容易想到,但是四个方向移动的代码比较繁琐.
 往上炸: 要从顶向下考虑
diff --git a/Java/Coin Change.java b/Java/Coin Change.java
@@ -1,5 +1,6 @@
 M
 1516583739
+tags: DP
 
 DP. 找对方程f[x], 积累到amount x最少用多少个coin: #coin是value, index是 [0~x].
 子问题的关系是: 如果用了一个coin, 那么就应该是f[x - coinValue]那个位置的#coins + 1
diff --git a/Java/Counting Bits.java b/Java/Counting Bits.java
@@ -1,5 +1,6 @@
 M
 1517292069
+tags: DP, Bit Manipulation
 
 Bit题目 用num的数值本身表示DP的状态.
 这里, dp[i] 并不是和 dp[i-1]有逻辑关系; 而是dp[i] 和dp[i>>1], 从binary representation看出有直接关系.
diff --git a/Java/Decode Ways.java b/Java/Decode Ways.java
@@ -1,5 +1,6 @@
 R
 1517300631
+tags: String, DP
 
 确定末尾的2种状态: single letter or combos. 然后计算出单个letter的情况, 和双数的情况
 note: calculate number from characters, need to - '0' to get the correct integer mapping.
diff --git a/Java/Encode and Decode TinyURL.java b/Java/Encode and Decode TinyURL.java
@@ -1,5 +1,6 @@
 M
 1516430518
+tags: Hash Table, Math
 
 其实想到了切入点, 是个可难可简单的题目. 这里的encode就是想办法把url存起来, 然后给个 key.
 那么具体怎么做这个key, 简单就可以用一个map, 然后counting. 复杂一点就可以做random letter/number组成key.
diff --git a/Java/Find Anagram Mappings.java b/Java/Find Anagram Mappings.java
@@ -1,5 +1,6 @@
 E
 1516255454
+tags: Hash Table
 
 比较简单, 用HashMap 存index list. 最后再遍历一遍数组A, 列举出所有元素.
 O(n)
diff --git a/Java/First Unique Character in a String.java b/Java/First Unique Character in a String.java
@@ -1,5 +1,6 @@
 E
 1516264417
+tags: Hash Table, String
 
 方法1: 按照题意, 找到第一个 first index == last index的字母.
 
diff --git a/Java/Guess Number Higher or Lower.java b/Java/Guess Number Higher or Lower.java
@@ -1,5 +1,6 @@
 E
 1516346617
+tags: Binary Search
 
 binary search 公式
 
diff --git a/Java/House Robber II.java b/Java/House Robber II.java
@@ -1,5 +1,6 @@
 M
 1517368869
+tags: DP
 
 和House Robber I 类似,  DP. 根据dp[i-1]是否被rob来讨论dp[i]: dp[i] = Math.max(dp[i-1], dp[i - 2] + nums[i - 1]);
 
diff --git a/Java/House Robber.java b/Java/House Robber.java
@@ -1,5 +1,6 @@
 E
 1517367917
+tags: DP
 
 最基本的dp。      
 看最后结尾状态的前一个或前两个的情况，再综合考虑当下的。      
diff --git a/Java/Island Perimeter.java b/Java/Island Perimeter.java
@@ -1,5 +1,6 @@
 E
 1516263328
+tags: Hash Table
 
 最简单的方法: 每个格子4个墙;每个shared的墙要-2 (墙是两面, -1 * 2)
 最后合计结果就好.
diff --git a/Java/Judge Route Circle.java b/Java/Judge Route Circle.java
@@ -1,5 +1,6 @@
 E
 1516256263
+tags: String
 
 简单的character checking. 各个方向, 加加减减.
 
diff --git a/Java/Jump Game.java b/Java/Jump Game.java
@@ -1,5 +1,6 @@
 M
 1516602798
+tags: Array, Greedy
 
 给出步数，看能不能reach to end.
 
diff --git a/Java/Longest Continuous Increasing Subsequence.java b/Java/Longest Continuous Increasing Subsequence.java
@@ -1,5 +1,6 @@
 E
 1516861466
+tags: Array, DP
 
 简单的DP:dp[i]存在i点时连续上升#. dp[i]时可能为0, 一旦断开.
 
diff --git a/Java/Longest Increasing Subsequence.java b/Java/Longest Increasing Subsequence.java
@@ -1,5 +1,6 @@
 M
 1516863852
+tags: Binary Search, DP
 
 方法1:
 [0 ~ i], 0<i<n: 以i为结尾, 每个不同的i会得出的max-length. 所以每个结尾i都要被考虑一遍.
diff --git a/Java/Maximum Product Subarray.java b/Java/Maximum Product Subarray.java
@@ -1,5 +1,6 @@
 M
 1516608238
+tags: Array, DP
 
 求最值, DP.
 两个特别处:
diff --git a/Java/Paint House II.java b/Java/Paint House II.java
@@ -1,5 +1,6 @@
 R
 1517386676
+tags: DP
 
 一般的DP被加了状态变成2D. 
 考虑最后位, 而前一位i-1又被i位的颜色限制, 于是在考虑 min dp[i] 时候, 又多了一层iteration.
diff --git a/Java/Paint House.java b/Java/Paint House.java
@@ -1,5 +1,6 @@
 E
 1517299065
+tags: DP
 
 考虑DP最后一个位置的情况. 发现给出了一些特殊条件, 需要附带在DP[i-1]上,
 那么就定义二维数组
diff --git a/Java/Plus One.java b/Java/Plus One.java
@@ -1,5 +1,6 @@
 E
 1516342836
+tags: Array, Math
 
 简单的实现, 加1, 进位. 唯一取巧的地方, 最后如果要多一位, 一定是10000...这个模式, 可以走捷径, 直接来个+1size的array, 然后第一位=1.
 注意,转换成long也不合理,用太多memory.
diff --git a/Java/Power of Three.java b/Java/Power of Three.java
@@ -1,5 +1,6 @@
 E
 1516341495
+tags: Math
 
 方法1:
 Power of 3:  3 ^ x == n ?
diff --git a/Java/Power of Two.java b/Java/Power of Two.java
@@ -1,5 +1,6 @@
 E
 1516343302
+tags: Math, Bit Manipulation
 
 跟powerOfThree一样: 可以loop, check mod; 也可以用binary search找合适的数字.
 
diff --git a/Java/Queue Reconstruction by Height.java b/Java/Queue Reconstruction by Height.java
@@ -1,5 +1,6 @@
 M
 1516438554
+tags: Greedy
 
 别无他法, 只能写一遍例子, 找规律,然后greedy. 
 需要写一遍发现的规律比如: 从h大的开始排列, 先放入k小的. 写comparator的时候要注意正确性.
diff --git a/Java/Reverse Vowels of a String.java b/Java/Reverse Vowels of a String.java
@@ -1,5 +1,6 @@
 E
 1516344636
+tags: Two Pointers, String
 
 方法1: two pointer. 前后两个指针, 在while loop里面跑. 注意 i<j, 一旦相遇, 就break. 找到合适的, 就做swap.
 StringBuffer可以 sb.setCharAt()记得用.
diff --git a/Java/Triangle Count.java b/Java/Triangle Count.java
@@ -1,5 +1,6 @@
 M
 1516683660
+tags: Array
 
 其实也就是3sum的变形, 或者而说2sum的变形. 主要用2 pointers来做.
 注意, 在选index时候每次定好一个 [0 ~ i], 在这里面找点start, end, 然后i 来组成triangle.
diff --git a/Java/Trim a Binary Search Tree.java b/Java/Trim a Binary Search Tree.java
@@ -1,5 +1,6 @@
 E
 1516868090
+tags: Tree
 
 方法1:
 适合复习BST. 用DFS对待每个node. 注意BST的特征: 所有left nodes都小于当下node, 所有right nodes都大于当下node.
diff --git a/Java/Unique Binary Search Tree.java b/Java/Unique Binary Search Tree.java
@@ -1,5 +1,6 @@
 M
 1516865694
+tags: DP, Tree
 
 Not quite clear.
 根据左右分割而总结出了原理, 每次分割, 左右两边都会有一定数量的permutation, 总体上的情况数量当然是相乘.
diff --git a/Java/Unique Path.java b/Java/Unique Path.java
@@ -1,5 +1,6 @@
 M
 1516585226
+tags: Array, DP
 
 可以DP.计数DP.
 注意方程式前两位置加在一起: 前两种情况没有overlap, 也不会缺情况.
diff --git a/Java/Unique Paths II.java b/Java/Unique Paths II.java
@@ -1,5 +1,6 @@
 M
 1517284913
+tags: Array, DP
 
 典型的坐标型DP. 考虑最终结尾需要的状态:如何组成,写出公式.
 公式中注意处理能跳掉的block, '到不了', 即为 0 path.
diff --git a/Java/Wiggle Sort.java b/Java/Wiggle Sort.java
@@ -1,5 +1,6 @@
 M
 1516434841
+tags: Array, Sort
 
 方法1:
 排序, nLog(n). 然后把直线上坡变成层叠山峰, 需要每隔几个(题目中是每隔2位)就做个swap 造成高低不平.
diff --git a/Java/k Sum.java b/Java/k Sum.java
@@ -1,5 +1,6 @@
 H
 1516774576
+tags: DP
 
 DP. 公式如何想到, 还需要重新理解.
 
diff --git a/README.md b/README.md
@@ -282,47 +282,47 @@
 |261|[Word Ladder.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Ladder.java)|Medium|Java|[]||
 |262|[Word Pattern.java](https://github.com/awangdev/LintCode/blob/master/Java/Word%20Pattern.java)|Easy|Java|[]||
 |263|[Zigzag Iterator.java](https://github.com/awangdev/LintCode/blob/master/Java/Zigzag%20Iterator.java)|N/A|Java|[]||
-|264|[Find Anagram Mappings.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20Anagram%20Mappings.java)|Easy|Java|[]||
-|265|[Judge Route Circle.java](https://github.com/awangdev/LintCode/blob/master/Java/Judge%20Route%20Circle.java)|Easy|Java|[]||
-|266|[Island Perimeter.java](https://github.com/awangdev/LintCode/blob/master/Java/Island%20Perimeter.java)|Easy|Java|[]||
-|267|[First Unique Character in a String.java](https://github.com/awangdev/LintCode/blob/master/Java/First%20Unique%20Character%20in%20a%20String.java)|Easy|Java|[]||
-|268|[Power of Three.java](https://github.com/awangdev/LintCode/blob/master/Java/Power%20of%20Three.java)|Easy|Java|[]||
-|269|[Plus One.java](https://github.com/awangdev/LintCode/blob/master/Java/Plus%20One.java)|Easy|Java|[]||
-|270|[Power of Two.java](https://github.com/awangdev/LintCode/blob/master/Java/Power%20of%20Two.java)|Easy|Java|[]||
-|271|[Reverse Vowels of a String.java](https://github.com/awangdev/LintCode/blob/master/Java/Reverse%20Vowels%20of%20a%20String.java)|Easy|Java|[]||
-|272|[Guess Number Higher or Lower.java](https://github.com/awangdev/LintCode/blob/master/Java/Guess%20Number%20Higher%20or%20Lower.java)|Easy|Java|[]||
-|273|[Encode and Decode TinyURL.java](https://github.com/awangdev/LintCode/blob/master/Java/Encode%20and%20Decode%20TinyURL.java)|Medium|Java|[]||
-|274|[Wiggle Sort.java](https://github.com/awangdev/LintCode/blob/master/Java/Wiggle%20Sort.java)|Medium|Java|[]||
-|275|[Queue Reconstruction by Height.java](https://github.com/awangdev/LintCode/blob/master/Java/Queue%20Reconstruction%20by%20Height.java)|Medium|Java|[]||
-|276|[2 Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/2%20Sum.java)|Easy|Java|[]|[Link](https://www.youtube.com/watch?v=P8zBxoVY1oI&feature=youtu.be)|
-|277|[2 Sum II - Input array is sorted.java](https://github.com/awangdev/LintCode/blob/master/Java/2%20Sum%20II%20-%20Input%20array%20is%20sorted.java)|Medium|Java|[]||
-|278|[2 Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/2%20Sum%20II.java)|Medium|Java|[]||
-|279|[Coin Change.java](https://github.com/awangdev/LintCode/blob/master/Java/Coin%20Change.java)|Medium|Java|[]||
-|280|[Unique Path.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Path.java)|Medium|Java|[]||
-|281|[Jump Game.java](https://github.com/awangdev/LintCode/blob/master/Java/Jump%20Game.java)|Medium|Java|[]||
-|282|[Maximum Product Subarray.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Product%20Subarray.java)|Medium|Java|[]||
-|283|[3 Sum Closest.java](https://github.com/awangdev/LintCode/blob/master/Java/3%20Sum%20Closest.java)|Medium|Java|[]||
-|284|[Triangle Count.java](https://github.com/awangdev/LintCode/blob/master/Java/Triangle%20Count.java)|Medium|Java|[]||
-|285|[3 Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/3%20Sum.java)|Medium|Java|[]||
-|286|[4 Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/4%20Sum.java)|Medium|Java|[]||
-|287|[k Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/k%20Sum.java)|Hard|Java|[]||
-|288|[Longest Continuous Increasing Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Continuous%20Increasing%20Subsequence.java)|Easy|Java|[]||
-|289|[Longest Increasing Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Subsequence.java)|Medium|Java|[]||
-|290|[Unique Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Binary%20Search%20Tree.java)|Medium|Java|[]||
-|291|[Trim a Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Trim%20a%20Binary%20Search%20Tree.java)|Easy|Java|[]||
-|292|[Unique Paths II.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Paths%20II.java)|Medium|Java|[]||
-|293|[Counting Bits.java](https://github.com/awangdev/LintCode/blob/master/Java/Counting%20Bits.java)|Medium|Java|[]||
-|294|[Bomb Enemy.java](https://github.com/awangdev/LintCode/blob/master/Java/Bomb%20Enemy.java)|Medium|Java|[]||
-|295|[Paint House.java](https://github.com/awangdev/LintCode/blob/master/Java/Paint%20House.java)|Easy|Java|[]||
-|296|[Decode Ways.java](https://github.com/awangdev/LintCode/blob/master/Java/Decode%20Ways.java)|Review|Java|[]||
-|297|[House Robber.java](https://github.com/awangdev/LintCode/blob/master/Java/House%20Robber.java)|Easy|Java|[]||
-|298|[House Robber II.java](https://github.com/awangdev/LintCode/blob/master/Java/House%20Robber%20II.java)|Medium|Java|[]||
-|299|[Best Time to Buy and Sell Stock I.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20I.java)|Easy|Java|[]||
-|300|[Best Time to Buy and Sell Stock II.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.java)|Easy|Java|[]||
-|301|[Best Time to Buy and Sell Stock III .java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III%20.java)|Hard|Java|[]||
-|302|[Best Time to Buy and Sell Stock IV.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV.java)|Hard|Java|[]||
-|303|[Paint House II.java](https://github.com/awangdev/LintCode/blob/master/Java/Paint%20House%20II.java)|Review|Java|[]||
-|304|[3 Sum Smaller.java](https://github.com/awangdev/LintCode/blob/master/Java/3%20Sum%20Smaller.java)|Medium|Java|[]||
+|264|[Find Anagram Mappings.java](https://github.com/awangdev/LintCode/blob/master/Java/Find%20Anagram%20Mappings.java)|Easy|Java|[Hash Table]||
+|265|[Judge Route Circle.java](https://github.com/awangdev/LintCode/blob/master/Java/Judge%20Route%20Circle.java)|Easy|Java|[String]||
+|266|[Island Perimeter.java](https://github.com/awangdev/LintCode/blob/master/Java/Island%20Perimeter.java)|Easy|Java|[Hash Table]||
+|267|[First Unique Character in a String.java](https://github.com/awangdev/LintCode/blob/master/Java/First%20Unique%20Character%20in%20a%20String.java)|Easy|Java|[Hash Table, String]||
+|268|[Power of Three.java](https://github.com/awangdev/LintCode/blob/master/Java/Power%20of%20Three.java)|Easy|Java|[Math]||
+|269|[Plus One.java](https://github.com/awangdev/LintCode/blob/master/Java/Plus%20One.java)|Easy|Java|[Array, Math]||
+|270|[Power of Two.java](https://github.com/awangdev/LintCode/blob/master/Java/Power%20of%20Two.java)|Easy|Java|[Bit Manipulation, Math]||
+|271|[Reverse Vowels of a String.java](https://github.com/awangdev/LintCode/blob/master/Java/Reverse%20Vowels%20of%20a%20String.java)|Easy|Java|[String, Two Pointers]||
+|272|[Guess Number Higher or Lower.java](https://github.com/awangdev/LintCode/blob/master/Java/Guess%20Number%20Higher%20or%20Lower.java)|Easy|Java|[Binary Search]||
+|273|[Encode and Decode TinyURL.java](https://github.com/awangdev/LintCode/blob/master/Java/Encode%20and%20Decode%20TinyURL.java)|Medium|Java|[Hash Table, Math]||
+|274|[Wiggle Sort.java](https://github.com/awangdev/LintCode/blob/master/Java/Wiggle%20Sort.java)|Medium|Java|[Array, Sort]||
+|275|[Queue Reconstruction by Height.java](https://github.com/awangdev/LintCode/blob/master/Java/Queue%20Reconstruction%20by%20Height.java)|Medium|Java|[Greedy]||
+|276|[2 Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/2%20Sum.java)|Easy|Java|[Array, Hash Table]||
+|277|[2 Sum II - Input array is sorted.java](https://github.com/awangdev/LintCode/blob/master/Java/2%20Sum%20II%20-%20Input%20array%20is%20sorted.java)|Medium|Java|[Array, Binary Search, Two Pointers]||
+|278|[2 Sum II.java](https://github.com/awangdev/LintCode/blob/master/Java/2%20Sum%20II.java)|Medium|Java|[Array, Binary Search, Two Pointers]||
+|279|[Coin Change.java](https://github.com/awangdev/LintCode/blob/master/Java/Coin%20Change.java)|Medium|Java|[DP]||
+|280|[Unique Path.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Path.java)|Medium|Java|[Array, DP]||
+|281|[Jump Game.java](https://github.com/awangdev/LintCode/blob/master/Java/Jump%20Game.java)|Medium|Java|[Array, Greedy]||
+|282|[Maximum Product Subarray.java](https://github.com/awangdev/LintCode/blob/master/Java/Maximum%20Product%20Subarray.java)|Medium|Java|[Array, DP]||
+|283|[3 Sum Closest.java](https://github.com/awangdev/LintCode/blob/master/Java/3%20Sum%20Closest.java)|Medium|Java|[Array, Two Pointers]||
+|284|[Triangle Count.java](https://github.com/awangdev/LintCode/blob/master/Java/Triangle%20Count.java)|Medium|Java|[Array]||
+|285|[3 Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/3%20Sum.java)|Medium|Java|[Array, Two Pointers]||
+|286|[4 Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/4%20Sum.java)|Medium|Java|[Hash Table]||
+|287|[k Sum.java](https://github.com/awangdev/LintCode/blob/master/Java/k%20Sum.java)|Hard|Java|[DP]||
+|288|[Longest Continuous Increasing Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Continuous%20Increasing%20Subsequence.java)|Easy|Java|[Array, DP]||
+|289|[Longest Increasing Subsequence.java](https://github.com/awangdev/LintCode/blob/master/Java/Longest%20Increasing%20Subsequence.java)|Medium|Java|[Binary Search, DP]||
+|290|[Unique Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Binary%20Search%20Tree.java)|Medium|Java|[DP, Tree]||
+|291|[Trim a Binary Search Tree.java](https://github.com/awangdev/LintCode/blob/master/Java/Trim%20a%20Binary%20Search%20Tree.java)|Easy|Java|[Tree]||
+|292|[Unique Paths II.java](https://github.com/awangdev/LintCode/blob/master/Java/Unique%20Paths%20II.java)|Medium|Java|[Array, DP]||
+|293|[Counting Bits.java](https://github.com/awangdev/LintCode/blob/master/Java/Counting%20Bits.java)|Medium|Java|[Bit Manipulation, DP]||
+|294|[Bomb Enemy.java](https://github.com/awangdev/LintCode/blob/master/Java/Bomb%20Enemy.java)|Medium|Java|[DP]||
+|295|[Paint House.java](https://github.com/awangdev/LintCode/blob/master/Java/Paint%20House.java)|Easy|Java|[DP]||
+|296|[Decode Ways.java](https://github.com/awangdev/LintCode/blob/master/Java/Decode%20Ways.java)|Review|Java|[DP, String]||
+|297|[House Robber.java](https://github.com/awangdev/LintCode/blob/master/Java/House%20Robber.java)|Easy|Java|[DP]||
+|298|[House Robber II.java](https://github.com/awangdev/LintCode/blob/master/Java/House%20Robber%20II.java)|Medium|Java|[DP]||
+|299|[Best Time to Buy and Sell Stock I.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20I.java)|Easy|Java|[Array, DP]||
+|300|[Best Time to Buy and Sell Stock II.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.java)|Easy|Java|[Array, Greedy]||
+|301|[Best Time to Buy and Sell Stock III .java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III%20.java)|Hard|Java|[Array, DP]||
+|302|[Best Time to Buy and Sell Stock IV.java](https://github.com/awangdev/LintCode/blob/master/Java/Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV.java)|Hard|Java|[DP]||
+|303|[Paint House II.java](https://github.com/awangdev/LintCode/blob/master/Java/Paint%20House%20II.java)|Review|Java|[DP]||
+|304|[3 Sum Smaller.java](https://github.com/awangdev/LintCode/blob/master/Java/3%20Sum%20Smaller.java)|Medium|Java|[Array, Two Pointers]||
 |305|[Array Partition I.java](https://github.com/awangdev/LintCode/blob/master/Java/Array%20Partition%20I.java)|Easy|Java|[Array]||
 |306|[1-bit and 2-bit Characters.java](https://github.com/awangdev/LintCode/blob/master/Java/1-bit%20and%202-bit%20Characters.java)|Easy|Java|[Array]||
 |307|[Non-decreasing Array.java](https://github.com/awangdev/LintCode/blob/master/Java/Non-decreasing%20Array.java)|Easy|Java|[Array]||
diff --git a/ReviewPage.md b/ReviewPage.md
diff --git a/TagsREADME.md b/TagsREADME.md

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`M`
`2`	`2`	`1516439332`
	`3`	`+tags: Array, Two Pointers, Binary Search`
`3`	`4`
`4`	`5`	`排序好的array. Two pointer移动start和end，核查sum.`
`5`	`6`	`注意sum用long.`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`M`
`2`	`2`	`1516439472`
	`3`	`+tags: Array, Two Pointers, Binary Search`
	`4`	`+`
`3`	`5`	`与 2sum II - input array is sorted类似. 都是sort array, 然后two pointer.`
`4`	`6`
`5`	`7`	`LintCode的题. 注意找的是greater/bigger than target。`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`E`
`2`	`2`	`1516438794`
	`3`	`+tags: Array, Hash Table`
	`4`	`+`
`3`	`5`	`tutorial:https://www.youtube.com/watch?v=P8zBxoVY1oI&feature=youtu.be`
`4`	`6`
`5`	`7`	`解法1：相对暴力简洁, HashMap<value, index>，找到一个value, 存一个; 若在HashMap里面 match 到结果, 就return HashMap里存的index. O(n) space && time.`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`M`
`2`	`2`	`1516610949`
	`3`	`+tags: Array, Two Pointers`
`3`	`4`
`4`	`5`	`3Sum 的一种简单形式, 并且都没有找index, value, 而只是找个sum罢了.`
`5`	`6`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`M`
`2`	`2`	`1517465602`
	`3`	`+tags: Two Pointers, Array`
`3`	`4`
`4`	`5`	`一般的O(n3)肯定不行。在此基础上优化。`
`5`	`6`	`发现j,k满足条件时候，(k - j)就是所有 sum <target的情况了。`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`M`
`2`	`2`	`1516689562`
	`3`	`+tags: Array, Two Pointers`
`3`	`4`
`4`	`5`	`方法1:`
`5`	`6`	`sort array, for loop + two pointer. O(n)`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`M`
`2`	`2`	`1516696879`
	`3`	`+tags: Hash Table`
`3`	`4`
`4`	`5`	`方法1：`
`5`	`6`	`1. 利用2Sum的原理，把4Sum分为连个2Sum。左一个pair,右一个pair，每个pair里面放2个数字。`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`E`
`2`	`2`	`1517372448`
	`3`	`+tags: Array, DP`
`3`	`4`
`4`	`5`	`理解意思是关键:`
`5`	`6`	`每天都就交易价格，n天只让买卖一次，那就找个最低价买进，找个最高价卖出。`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`E`
`2`	`2`	`1517373801`
	`3`	`+tags: Array, Greedy`
	`4`	`+`
`3`	`5`	`和Stock I 的区别：可以买卖多次，求总和的最大盈利。`
`4`	`6`
`5`	`7`	`这道题有几种其他不同的思路:`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`H`
`2`	`2`	`1517376279`
	`3`	`+tags: Array, DP`
`3`	`4`
`4`	`5`	`比stock II 多了一个限制：只有2次卖出机会。`
`5`	`6`