2019年7月27日
[Leetcode]87. Scramble String
摘要： "[Leetcode]87. Scramble String" 本题难度: Hard Topic: divide and conquere Description Given a string s1, we may represent it as a binary tree by partition 阅读全文
posted @ 2019-07-27 15:02 siriusli 阅读(126) 评论(0) 推荐(0)
[Leetcode]981. Time Based Key-Value Store
摘要： "[Leetcode]981. Time Based Key Value Store" 本题难度: Medium Description Create a timebased key value store class TimeMap, that supports two operations. 1 阅读全文
posted @ 2019-07-27 14:59 siriusli 阅读(128) 评论(0) 推荐(0)
[Leetcode]658. Find K Closest Elements
摘要： "[Leetcode]658. Find K Closest Elements" 本题难度: Hard/Medium Topic: Data Structure Description 我的代码 python import bisect class Solution: def findClosest 阅读全文
posted @ 2019-07-27 14:58 siriusli 阅读(75) 评论(0) 推荐(0)
[Lintcode] 932. Beautiful Array
摘要： "Leetcode:932. Beautiful Array" 本题难度: Hard Topic: divide and conquer Description For some fixed N, an array A is beautiful if it is a permutation of t 阅读全文
posted @ 2019-07-27 14:47 siriusli 阅读(132) 评论(0) 推荐(0)