百草园

摘要： Design a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can search a literal word or a regu... 阅读全文

摘要： Given string A representative a positive integer which hasNdigits, remove anykdigits of the number, the remaining digits are arranged according to the... 阅读全文

摘要： Given an interval list which are flying and landing time of the flight. How many airplanes are on the sky at most?ExampleFor interval list[[1,10],[2,3... 阅读全文

摘要： Given an integer array, find a subarray with sum closest to zero. Return the indexes of the first number and last number.ExampleGiven [-3, 1, 1, -3, 5... 阅读全文

摘要： There are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 you have to firs... 阅读全文

摘要： Given an array ofnpositive integers and a positive integers, find the minimal length of a subarray of which the sum ≥s. If there isn't one, return 0 i... 阅读全文

摘要： Implement a trie withinsert,search, andstartsWithmethods.Note:You may assume that all inputs are consist of lowercase lettersa-z.实现字典树，没啥好说的。 1 class ... 阅读全文

摘要： There are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 you have to firs... 阅读全文

摘要： 时间限制:10000ms单点时限:1000ms内存限制:256MB描述今天我们要认识一对新朋友，Alice与Bob。Alice与Bob总是在进行各种各样的比试，今天他们在玩一个取石子的游戏。在这个游戏中，Alice和Bob放置了N堆不同的石子，编号1..N，第i堆中有A[i]个石子。每一次行动，Al... 阅读全文

摘要： 时间限制:10000ms单点时限:1000ms内存限制:256MB描述上回说到，小Ho有着一棵灰常好玩的树玩具！这棵树玩具是由N个小球和N-1根木棍拼凑而成，这N个小球都被小Ho标上了不同的数字，并且这些数字都是处于1..N的范围之内，每根木棍都连接着两个不同的小球，并且保证任意两个小球间都不存在两... 阅读全文