2017年03月_utobe67

12月 03月 01月

原创 leetcode 76. Minimum Window Substring

76. Minimum Window Substring Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T =

2017-03-26 13:05:19 482

原创 leetcode 456. 132 Pattern

456. 132 Pattern Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, ak such that i j k and ai < ak j. Design an algorithm that takes a list of n numb

2017-03-26 11:19:25 577

原创 leetcode 432. All O`one Data Structure

432. All O`one Data Structure Implement a data structure supporting the following operations: Inc(Key) - Inserts a new key with value 1. Or increments an existing key by 1. Key is guarante

2017-03-26 11:14:45 588

原创 leetcode 146. LRU Cache 460. LFU Cache

146. LRU Cache Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - Get the value (will always be po

2017-03-15 23:05:45 542

原创 leetcode 4. Median of Two Sorted Arrays

There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: nums1 =

2017-03-12 13:25:56 301

原创 Kickstart Round A 2017 Problem A. Square Counting Problem B. Patterns Overlap

感想： Kickstart Round A小计，第一次打Kickstart，据说是进google的必经之路，难度确实还比较难，更可怕的是前面厉害的人太多，第三题是计算几何碰都没怎么碰过的题，AK的人还是那么多= =，可见进google是有多么大的竞争。比赛时只能做出A和b的small，比赛完后想想B的big也是可以做的，然后就做了。 ps：第一次打这个比赛，有些规则不是很清楚，原来每次给出

2017-03-05 22:07:04 1454 5

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人