摘要:
Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.... 阅读全文
摘要:
Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co... 阅读全文
摘要:
Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".思路: 从后向前加,保持进位,当无进位,且遍历完毕时结束。注意:Collections.rev... 阅读全文
摘要:
http://blog.csdn.net/terro/article/details/1745699Trie数:思想表示词典数,即用树形结构表示词典。仅需要修改TrieNode中参数即可。1)可以用来查找相同前缀,最长的前缀2)查找相同前缀的个数3)查找某个单词是否出现过#include using... 阅读全文