2016年1月18日
Maximum Product of Word Lengths -- LeetCode
摘要： Given a string arraywords, find the maximum value oflength(word[i]) * length(word[j])where the two words do not share common letters. You may assume t... 阅读全文
posted @ 2016-01-18 04:21 fenshen371 阅读(180) 评论(0) 推荐(0) 编辑