2015年12月17日
[leetcode] Maximum Product of Word Lengths
摘要： 题目：Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may as... 阅读全文
posted @ 2015-12-17 12:44 lasclocker 阅读(165) 评论(0) 推荐(0) 编辑