forever_cc

 

01 2016 档案

315. Count of Smaller Numbers After Self
摘要:You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smal... 阅读全文

posted @ 2016-01-22 15:23 forever_cc 阅读(638) 评论(0) 推荐(0)

316. Remove Duplicate Letters
摘要:Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your... 阅读全文

posted @ 2016-01-21 14:22 forever_cc 阅读(256) 评论(0) 推荐(0)

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 阅读(220) 评论(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 阅读(153) 评论(0) 推荐(0)

导航