2016年2月20日
leetcode@ [318] Maximum Product of Word Lengths (Bit Manipulations)
摘要： https://leetcode.com/problems/maximum-product-of-word-lengths/ Given a string array words, find the maximum value of length(word[i]) * length(word[j]) 阅读全文
posted @ 2016-02-20 05:17 流白 阅读(277) 评论(0) 推荐(0) 编辑
leetcode@ [49] Group Anagrams (Hashtable)
摘要： https://leetcode.com/problems/anagrams/ Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan", "ate", "nat", "b 阅读全文
posted @ 2016-02-20 02:17 流白 阅读(250) 评论(0) 推荐(0) 编辑