LeetCode 【318. 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-08-16 10:54 Rockwall 阅读(175) 评论(0) 推荐(0)
浙公网安备 33010602011771号