摘要：
This is a 0/1 backpacking problem The problem can be interpreted as: What's the max number of str can we pick from strs with limitation of m "0"s and 阅读全文
摘要：
Binary Search My solution: Be careful in my binary search function, l, r may go out of the range of the array Solution with the highest vote: 阅读全文
摘要：
Example: 0 0 0 0 0 1 0 0 1 1 1 0 0 0 1 0 Total Hamming Distance = (3*1) + (2*2) + (2*2) + (4*0) = 11 so the idea is count the number of 1 and 0 on eac 阅读全文
摘要：
Solution 1: Solution 2: 阅读全文
摘要：
这题看起来简单但是其实很容易写错 本来想j 不从0开始，而是从 i+1开始检查，可以节省时间，但是一些为Null的情况会使讨论很复杂 比如 阅读全文
摘要：
先来一个brute force, 类似Text Adjustment 但是在稍微大一点的case就TLE了，比如： ["a","b","e"] 20000 20000， 花了465ms 所以想想怎么节约时间， 提示是可以DP的，想想怎么复用，refer to: https://discuss.lee 阅读全文
摘要：
Refer to https://discuss.leetcode.com/topic/61799/java-bit-mask-dfs-with-pruning bit mask refer to http://bookshadow.com/weblog/2016/10/02/leetcode-mi 阅读全文