cmy203的博客

Design a data structure that supports all following operations inaverageO(1)time.Note: Duplicate elements are allowed.insert(val): Inserts an item val to the collection. remove(val): Remove...

You are given a string,s, and a list of words,words, that are all of the same length. Find all starting indices of substring(s) insthat is a concatenation of each word inwordsexactly once and wi...

Given a list ofuniquewords, find all pairs ofdistinctindices(i, j)in the given list, so that the concatenation of the two words, i.e.words[i] + words[j]is a palindrome.Example 1:Input: ["...

You haveklists of sorted integers in ascending order. Find thesmallestrange that includes at least one number from each of theklists.We define the range [a,b] is smaller than range [c,d] ifb-...

Implement a data structure supporting the following operations:Inc(Key) - Inserts a new keywith value 1. Or increments an existing key by 1. Key is guaranteed to be anon-emptystring. Dec(Key)...

You are given a stringexpressionrepresenting a Lisp-like expression to return the integer value of.The syntax for these expressions is given as follows.An expression is either an integer, a le...

A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.For example, these are arithmetic sequence...

设计并实现最不经常使用（LFU）缓存的数据结构。它应该支持以下操作：get和put。get(key)- 如果键存在于缓存中，则获取键的值（总是正数），否则返回 -1。put(key, value)- 如果键不存在，请设置或插入值。当缓存达到其容量时，它应该在插入新项目之前，使最不经常使用的项目无效。在此问题中，当存在平局（即两个或更多个键具有相同使用频率）时，最近最少使用的键将被去除...

In a 1 million by 1 million grid, the coordinates of each grid square are(x, y)with0 <= x, y < 10^6.We start at thesourcesquare and want to reach thetargetsquare. Each move, we can wal...