2016年7月28日
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 assum 阅读全文
posted @ 2016-07-28 10:05 Roger's 阅读(144) 评论(0) 推荐(0) 编辑