forever_cc

 

2016年1月20日

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-01-20 15:13 forever_cc 阅读(208) 评论(0) 推荐(0) 编辑

LeetCode Bulb Switcher 319

摘要： 变换灯泡颜色There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle ... 阅读全文

posted @ 2016-01-20 14:08 forever_cc 阅读(136) 评论(0) 推荐(0) 编辑

导航