05 2017 档案

摘要:"Range Sum Query 2D Mutable" Difficulty hard tags Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper lef 阅读全文
posted @ 2017-05-19 17:00 whensean 阅读(120) 评论(0) 推荐(0)
摘要:介绍了Binary Indexed Tree的原理, 构建和基本操作 阅读全文
posted @ 2017-05-14 00:06 whensean 阅读(2099) 评论(0) 推荐(2)
摘要:Sentence Screen Fitting Difficulty medium tags unordered_map Given a rows x cols screen and a sentence represented by a list of non-empty words, find 阅读全文
posted @ 2017-05-04 22:07 whensean 阅读(139) 评论(0) 推荐(0)
摘要:"Longest Substring with At Most K Distinct Characters" Difficulty hard tags `unordered_map` Given a string, find the length of the longest substring T 阅读全文
posted @ 2017-05-03 21:22 whensean 阅读(112) 评论(0) 推荐(0)
摘要:License Key Formatting Difficulty Medium tags string Now you are given a string S, which represents a software license key which we would like to form 阅读全文
posted @ 2017-05-03 14:53 whensean 阅读(107) 评论(0) 推荐(0)
摘要:Decode String Difficulty Medium tags recur Given an encoded string, return it's decoded string. The encoding rule is: k[encoded_string], where the enc 阅读全文
posted @ 2017-05-02 15:50 whensean 阅读(79) 评论(0) 推荐(0)