逸朵 - 博客园

2018年1月8日

摘要： Some useful articles: http://www.cnblogs.com/LBSer/p/3310455.html http://www.meetqun.net/thread-25663-1-1.html https://www.quora.com/How-do-I-evaluate 阅读全文

posted @ 2018-01-08 09:33 逸朵阅读(206) 评论(0) 推荐(0)

Find nearest gas stations close to my home (Point of interest problem / spatial index / R tree)

摘要： There are lots of similar problems as "Find nearest gas stations close to my home", I found the following article can give you a general idea how to s 阅读全文

posted @ 2018-01-08 09:29 逸朵阅读(524) 评论(0) 推荐(0)

2018年1月5日

Leetcode 604: Design Compressed String Iterator

摘要： Design and implement a data structure for a compressed string iterator. It should support the following operations: next and hasNext. The given compre 阅读全文

posted @ 2018-01-05 06:19 逸朵阅读(138) 评论(0) 推荐(0)

2018年1月2日

Leetcode 535: Encode and Decode TinyURL

摘要： TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http 阅读全文

posted @ 2018-01-02 05:35 逸朵阅读(255) 评论(0) 推荐(0)

Leetcode 384: Shuffle an Array

摘要： Shuffle a set of numbers without duplicates. Example: 阅读全文

posted @ 2018-01-02 04:13 逸朵阅读(128) 评论(0) 推荐(0)

Leetcode 381: Insert Delete GetRandom O(1) - Duplicates allowed

摘要： Design a data structure that supports all following operations in average O(1) time. Note: Duplicate elements are allowed. insert(val): Inserts an ite 阅读全文

posted @ 2018-01-02 03:49 逸朵阅读(142) 评论(0) 推荐(0)

2018年1月1日

Leetcode 366: Find Leaves of Binary Tree

摘要： Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example:Given bi 阅读全文

posted @ 2018-01-01 07:18 逸朵阅读(216) 评论(0) 推荐(0)

Leetcode 364: Nested List Weight Sum II

摘要： Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list -- w 阅读全文

posted @ 2018-01-01 06:52 逸朵阅读(385) 评论(0) 推荐(0)

Leetcode 362: Design Hit Counter

摘要： Design a hit counter which counts the number of hits received in the past 5 minutes. Each function accepts a timestamp parameter (in seconds granulari 阅读全文

posted @ 2018-01-01 06:27 逸朵阅读(295) 评论(0) 推荐(0)

Dropbox Interview – Design Hit Counter

摘要： It starts with a simple question – if you are building a website, how do you count the number of visitors for the past 1 minute? “Design hit counter” 阅读全文

posted @ 2018-01-01 06:05 逸朵阅读(279) 评论(0) 推荐(0)

Keep walking

公告