Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a …

  Design a max stack that supports push, pop, top, peekMax and popMax.   push(x) — Push elemen…

1. 题目 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).…

1. 题目 Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If …

My code: public class Solution { public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) { if (…

  Convert a non-negative integer to its english words representation. Given input is guaranteed to be les…

Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance between two…

Count Primes Description: Count the number of prime numbers less than a non-negative number, n. 埃拉托斯特尼筛法 Sieve…

这是悦乐书的第168次更新，第170篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第27题（顺位题号是111）。给定二叉树，找到它的最小深度。最小深度是沿从根节点到最近的叶节点的最短路径上的…

  Merge two sorted linked lists and return it as a new list. The new list should be made by splicing toge…

  Follow up for “Unique Paths”: Now consider if some obstacles are added to the grids. How ma…

  Say you have an array for which the ith element is the price of a given stock on day i. …